Sujet : Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error
De : Keith.S.Thompson+u (at) *nospam* gmail.com (Keith Thompson)
Groupes : comp.theoryDate : 22. Apr 2025, 23:25:52
Autres entêtes
Organisation : None to speak of
Message-ID : <87o6wnygsv.fsf@nosuchdomain.example.com>
References : 1 2 3 4 5 6 7
User-Agent : Gnus/5.13 (Gnus v5.13)
Mr Flibble <
flibble@red-dwarf.jmc.corp> writes:
On Mon, 21 Apr 2025 18:27:15 -0700, Keith Thompson wrote:
Mr Flibble <flibble@red-dwarf.jmc.corp> writes:
[...]
Finite number of steps? See Flibble's Law.
Yes, finite number of steps. I saw Flibble's Law. It doesn't interest
me, nor does proof by tedious repetition.
>
What does or does not interest you is of little consequence. Flibble's Law
stands.
"Flibble's Law" stands nowhere outside your head. You are free
to introduce any consistent axiom you like in a newly defined
mathematical system, but nobody else is required to pay attention
to it or pretend that your new system is interesting or useful.
Thompson's Law: Mr Flibble is wrong.
Do not expect me to respond further.
-- Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.comvoid Void(void) { Void(); } /* The recursive call of the void */