Sujet : Re: UTM Theorem vs the identity function
De : pa (at) *nospam* see.signature.invalid (Pierre Asselin)
Groupes : comp.theoryDate : 22. Oct 2025, 19:45:22
Autres entêtes
Organisation : PANIX Public Access Internet and UNIX, NYC
Message-ID : <10db8o2$tr$1@reader2.panix.com>
References : 1 2 3
User-Agent : tin/2.6.4-20241224 ("Helmsdale") (NetBSD/10.1 (amd64))
Tristan Wibberley <tristan.wibberley+
netnews2@alumni.manchester.ac.uk> wrote:
That damned wikipedia again. It didn't constrain e to Goedel numbers.
Quoting from the Wikipedia article "UTM theorem":
The theorem states that a partial computable function u of
two variables exists such that, for every computable function
f of one variable, a Goedel number e exists such that f (
x ) ? u ( e , x ) {\displaystyle f(x)\simeq u(e,x)} for
all x.
Notice the phrase "a Goedel number e". Were you reading some other
article?
-- pa at panix dot comThis self-referential copyright notice is in the public domain.
Haut de la page
Les messages affichés proviennent d'usenet.
NewsPortal