Sujet : Re: UTM Theorem vs the identity function
De : tristan.wibberley+netnews2 (at) *nospam* alumni.manchester.ac.uk (Tristan Wibberley)
Groupes : comp.theoryDate : 22. Oct 2025, 03:48:01
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <10d9gl1$btl9$1@dont-email.me>
References : 1 2
User-Agent : Mozilla Thunderbird
On 21/10/2025 19:50, Pierre Asselin wrote:
Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> wrote:
* u is a computable function;
* f is a computable function;
* e is the Gödel number of a Turing machine that computes f.
How can e and f be equal ?
That damned wikipedia again. It didn't constrain e to Goedel numbers.
There appears to be a trend of having wikipedia leave out key
constraints thus making its statements about formalised things be
universally qualified when they shouldn't be and therefore untrue.
-- Tristan WibberleyThe message body is Copyright (C) 2025 Tristan Wibberley exceptcitations and quotations noted. All Rights Reserved except that you may,of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
Haut de la page
Les messages affichés proviennent d'usenet.
NewsPortal