| Deutsch English Français Italiano |
|
<v7mghg$qehe$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: sci.math Subject: Re: WM and end segments... Date: Mon, 22 Jul 2024 13:47:44 -0700 Organization: A noiseless patient Spider Lines: 42 Message-ID: <v7mghg$qehe$1@dont-email.me> References: <v7jrk4$7rnq$2@dont-email.me> <87ed7m7349.fsf@bsb.me.uk> <0QcM9G1omJ2PKIjSNt0DAeubbXs@jntp> <v7lslt$ut9$1@news.muc.de> <egPMHBTvfiPkgtOjcVsL2aBLYgQ@jntp> <v7mctk$25j9$2@news.muc.de> <hYHBwcZP2l4WCfbU19WrhqVGTLo@jntp> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 22 Jul 2024 22:47:45 +0200 (CEST) Injection-Info: dont-email.me; posting-host="e5e0901eabcdb6107cf2334f05523c53"; logging-data="866862"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+9C052zJDQEIZojJr03NrVcXt3kJWom8s=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:ni3hcqZ/Sacftc1oOm93mF8wELE= In-Reply-To: <hYHBwcZP2l4WCfbU19WrhqVGTLo@jntp> Content-Language: en-US Bytes: 2959 On 7/22/2024 1:14 PM, WM wrote: > Le 22/07/2024 à 21:45, Alan Mackenzie a écrit : >> WM <wolfgang.mueckenheim@tha.de> wrote: > >>> Only a matheologian fixed in his views can claim that after knowing >>> my game >> >> We've known your game for years; > > You have not understood it. Otherwise if not agreeing you could show an > error. But you can only curse: > >> it is to obfuscate, confuse, and lie. > >>> "You seem to be ignoring the fact that, after you have colored a >>> countable family of pathes, say P0, P1, ..., Pn, ..., there may be >>> other paths Q that are not on this countable list but have, >>> nevertheless, had all their nodes and edges colored. Perhaps the >>> first node and edge of Q were also in P1, the second node and edge of >>> Q were in P2, etc. [...] by choosing the sequence of Pn's >>> intelligently, you can, in fact, ensure that this sort of thing >>> happens for every path Q." [Andreas Blass, loc cit] >> >> It can happen for every FINITE path Q. > > Not for finite and not for infinite paths. If the second node is in P2, > then also the first node is in P2. That is the principle of the Binary > Tree. > >> An infinite path in an infinite binary tree can be coded as an infinite >> sequence of Ls and Rs, corresponding to whether at the next node one goes >> left or right. So, for example, the very first path might be >> LLLLLLLL..... > > It is impossible to use infinite sequences of Ls or Rs. What can be used > is a finite abbreviation like "LLLLLLLL.....". But there are only > countably many finite Huh? lol. Humm... You are a HYPER Finite person. That about sums it up. Your mind cannot fathom infinity of any kind. [...]