Sujet : Re: 2N=E
De : james.g.burns (at) *nospam* att.net (Jim Burns)
Groupes : sci.mathDate : 01. Nov 2024, 16:50:55
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <e3d63873-a9f2-46f5-8b39-a8f9492d38f8@att.net>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
User-Agent : Mozilla Thunderbird
On 11/1/2024 6:13 AM, WM wrote:
On 31.10.2024 22:05, joes wrote:
Am Thu, 31 Oct 2024 19:30:00 +0100 schrieb WM:
On 31.10.2024 19:07, Jim Burns wrote:
A finite sequence of only
true.or.not.first.false 𝗰𝗹𝗮𝗶𝗺𝘀
holds a 𝗰𝗹𝗮𝗶𝗺 that,
after all swaps, Bob is not in
any visible or dark room which he has ever been in.
>
He is not elsewhere either.
>
He is nowhere.
>
My logic prohibits
a loss during lossless exchange,
even if repeated infinitely often.
Define
lossless i :⇔
i.many exchanges must be lossless
Consider the set Lossless of the lossless
Lossless = {i: lossless i}
For each j ∈ Lossless:
⟨0,1,...,j-1,j,j+1⟩ ⊆ Lossless and
the set Lossless is more.than.j.many and
For each j ∈ Lossless:
the set Lossless is not that lossless j.many
However.many the set Lossless is,
that.many exchanges can be not.lossless.
In my theory I apply this logic.
'Infinite' does not mean what you want it to mean.