Sujet : Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 07. May 2025, 19:14:54
Autres entêtes
Organisation : Fix this later
Message-ID : <vvg7uu$158tp$4@dont-email.me>
References : 1 2 3 4 5 6 7 8 9
User-Agent : Mozilla Thunderbird
On 07/05/2025 18:55, olcott wrote:
When THERE IS NO CONTRADICTION then proof by contradiction fails.
How do you not get that?
I do. You must be talking about the Olcott Problem again, because the contradiction is inherent in the Halting Problem.
It starts with the assumption that a universal halt decider can be written, and then shows that such a decider can be used to devise a program that the 'universal' decider can't decide --- a contradiction.
But you already know all this.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within
…