Sujet : Re: Flibble’s Leap: Why Behavioral Divergence Implies a Type Distinction in the Halting Problem
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theoryDate : 11. May 2025, 17:11:28
Autres entêtes
Organisation : Fix this later
Message-ID : <vvqi7g$g8ck$2@dont-email.me>
References : 1 2 3 4
User-Agent : Mozilla Thunderbird
On 11/05/2025 16:49, olcott wrote:
Yes and that can be applied to creating a formal system
that comprises the set of all knowledge that can be
expressed in language. In this case Unprovable(x) means
~Knowledge(x). Undecidability cannot possibly occur.
Look up Gödel.
-- Richard HeathfieldEmail: rjh at cpax dot org dot uk"Usenet is a strange place" - dmr 29 July 1999Sig line 4 vacant - apply within