Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: wij <wyniijj5@gmail.com>
Newsgroups: comp.theory
Subject: Re: How to write a self-referencial TM?
Date: Mon, 19 May 2025 06:35:33 +0800
Organization: A noiseless patient Spider
Lines: 311
Message-ID: <0678040070c634b30141edfab996b3e522f4a74d.camel@gmail.com>
References: <1e4f1a15826e67e7faf7a3c2104d09e9dadc6f06.camel@gmail.com>
	 <1002akp$2i4bk$2@dont-email.me>
	 <479eebef3bd93e82c8fe363908b254b11d15a799.camel@gmail.com>
	 <1002jkk$2k00a$3@dont-email.me>
	 <05e306f20fcb7c88c497e353aaecd36b30fc752a.camel@gmail.com>
	 <10053hb$3759k$1@dont-email.me>
	 <879b3c552bad9da9885e41a298b570c92bef1aaf.camel@gmail.com>
	 <10061h6$3de5f$1@dont-email.me>
	 <4bce5af2b2b8cd198af611e5d8d56598cab15b0a.camel@gmail.com>
	 <10067ok$3ib39$1@dont-email.me>
	 <e63d3083ddf6b9ab172cc24c07155410d81ce5b4.camel@gmail.com>
	 <1007lrp$3r388$1@dont-email.me>
	 <0cbe88d46c63af596e4d2ad6a846e61b7efb14bb.camel@gmail.com>
	 <1008fhf$53u$1@dont-email.me>
	 <cd31647abcc33f0978415df34ec2c8d41d886591.camel@gmail.com>
	 <100a7e4$efgi$1@dont-email.me>
	 <f94f006b40c3ca204d41be9b4507280a3a4fc17b.camel@gmail.com>
	 <100aolc$hq2u$1@dont-email.me>
	 <943f3512f1c253f770eb41519145d4159c0cd6aa.camel@gmail.com>
	 <100dhiv$167g2$1@dont-email.me>
	 <53caddf143d1319d6aef95fb8b349f6b6e07d288.camel@gmail.com>
	 <100dlrb$16vdn$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Mon, 19 May 2025 00:35:36 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="745d7f42001f5c9522e6574626815520";
	logging-data="1296289"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/wr8+WAoctDDWoOJwOZtAN"
User-Agent: Evolution 3.54.3 (3.54.3-1.fc41)
Cancel-Lock: sha1:Rz29LhjkUUcE5Bm3kKWgbi9Op3A=
In-Reply-To: <100dlrb$16vdn$3@dont-email.me>
Bytes: 15185

On Sun, 2025-05-18 at 17:09 -0500, olcott wrote:
> On 5/18/2025 4:46 PM, wij wrote:
> > On Sun, 2025-05-18 at 15:57 -0500, olcott wrote:
> > > On 5/18/2025 3:35 PM, wij wrote:
> > > > On Sat, 2025-05-17 at 14:39 -0500, olcott wrote:
> > > > > On 5/17/2025 2:26 PM, wij wrote:
> > > > > > On Sat, 2025-05-17 at 15:45 +0100, Mike Terry wrote:
> > > > > > > On 17/05/2025 04:01, wij wrote:
> > > > > > > > On Fri, 2025-05-16 at 23:51 +0100, Mike Terry wrote:
> > > > > > > > > On 16/05/2025 20:35, wij wrote:
> > > > > > > > > > On Fri, 2025-05-16 at 16:33 +0100, Mike Terry wrote:
> > > > > > > > > > > On 16/05/2025 12:40, wij wrote:
> > > > > > > > > > > > On Fri, 2025-05-16 at 03:26 +0100, Mike Terry wrote=
:
> > > > > > > > > > > > > On 16/05/2025 02:47, wij wrote:
> > > > > > > > > > > > > > On Fri, 2025-05-16 at 01:40 +0100, Mike Terry w=
rote:
> > > > > > > > > > > > > > > On 15/05/2025 19:49, wij wrote:
> > > > > > > > > > > > > > > > On Thu, 2025-05-15 at 17:08 +0100, Mike Ter=
ry wrote:
> > > > > > > > > > > > > > > > > On 14/05/2025 18:53, wij wrote:
> > > > > > > > > > > > > > > > > > On Wed, 2025-05-14 at 12:24 -0500, olco=
tt wrote:
> > > > > > > > > > > > > > > > > > > On 5/14/2025 11:43 AM, wij wrote:
> > > > > > > > > > > > > > > > > > > > On Wed, 2025-05-14 at 09:51 -0500, =
olcott wrote:
> > > > > > > > > > > > > > > > > > > > > On 5/14/2025 12:13 AM, wij wrote:
> > > > > > > > > > > > > > > > > > > > > > Q: Write a turing machine that =
performs D function (which
> > > > > > > > > > > > > > > > > > > > > > calls
> > > > > > > > > > > > > > > > > > > > > > itself):
> > > > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > > > void D() {
> > > > > > > > > > > > > > > > > > > > > > =C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0 D();
> > > > > > > > > > > > > > > > > > > > > > }
> > > > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > > > Easy?
> > > > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > > That is not a TM.
> > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > It is a C program that exists. Ther=
efore, there must be a
> > > > > > > > > > > > > > > > > > > > equivalent
> > > > > > > > > > > > > > > > > > > > TM.
> > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > > To make a TM that references itse=
lf the closest
> > > > > > > > > > > > > > > > > > > > > thing is a UTM that simulates its=
 own TM source-code.
> > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > > How does a UTM simulate its own TM =
source-code?
> > > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > > You run a UTM that has its own source=
-code on its tape.
> > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > > What is exactly the source-code on its =
tape?
> > > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > Every UTM has some scheme which can be ap=
plied to a (TM & input
> > > > > > > > > > > > > > > > > tape)
> > > > > > > > > > > > > > > > > that
> > > > > > > > > > > > > > > > > is to
> > > > > > > > > > > > > > > > > be
> > > > > > > > > > > > > > > > > simulated.
> > > > > > > > > > > > > > > > > The
> > > > > > > > > > > > > > > > > scheme says how to turn the (TM + input t=
ape) into a string of
> > > > > > > > > > > > > > > > > symbols
> > > > > > > > > > > > > > > > > that
> > > > > > > > > > > > > > > > > represent
> > > > > > > > > > > > > > > > > that
> > > > > > > > > > > > > > > > > computation.
> > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > So to answer your question, the "source-c=
ode on its tape" is the
> > > > > > > > > > > > > > > > > result
> > > > > > > > > > > > > > > > > of
> > > > > > > > > > > > > > > > > applying
> > > > > > > > > > > > > > > > > the
> > > > > > > > > > > > > > > > > UTM's
> > > > > > > > > > > > > > > > > particular scheme to the combination (UTM=
, input tape) that is to be
> > > > > > > > > > > > > > > > > simulated.
> > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > If you're looking for the exact string sy=
mbols, obviously you would
> > > > > > > > > > > > > > > > > need
> > > > > > > > > > > > > > > > > to
> > > > > > > > > > > > > > > > > specify
> > > > > > > > > > > > > > > > > the
> > > > > > > > > > > > > > > > > exact
> > > > > > > > > > > > > > > > > UTM
> > > > > > > > > > > > > > > > > being used, because every UTM will have a=
 different answer to your
> > > > > > > > > > > > > > > > > question.
> > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > > Mike.
> > > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > > People used to say UTM can simulate all TM.=
 I was questing such a UTM.
> > > > > > > > > > > > > > > > Because you said "Every UTM ...", so what i=
s the source of such UTM?
> > > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > > Yes, a UTM can simulate any TM including itse=
lf.=C2=A0 (Nothing magical
> > > > > > > > > > > > > > > changes
> > > > > > > > > > > > > > > when
> > > > > > > > > > > > > > > a
> > > > > > > > > > > > > > > UTM
> > > > > > > > > > > > > > > simulates
> > > > > > > > > > > > > > > itself, as opposed to some other TM.)
> > > > > > > > > > > > > >=20
> > > > > > > > > > > > > > Supposed UTM exists, and denoted as U(X), X den=
otes the tape contents of
> > > > > > > > > > > > > > the
> > > > > > > > > > > > > > encoding of a TM. And, U(X) should function the=
 same like X.
> > > > > > > > > > > > > > Given instance U(U(f)), it should function like=
 f from the above
> > > > > > > > > > > > > > definition.
> > > > > > > > > > > > > > But, U(U(f)) would fall into a 'self-reference'=
 trap.
> > > > > > > > > > > > >=20
> > > > > > > > > > > > > There is no self-reference trap.
> > > > > > > > > > > > >=20
> > > > > > > > > > > > > In your notation:
> > > > > > > > > > > > >=20
> > > > > > > > > > > > > -=C2=A0 f represents some computation.
> > > > > > > > > > > > > -=C2=A0 U(f) represents U being run with f on its=
 tape.
> > > > > > > > > > > > > =C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0 Note this is itself a computation, distinct from f of course
> > > > > > > > > > > > > =C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=C2=A0=
=C2=A0 but having the same behaviour.
> > > > > > > > > > > > > -=C2=A0 U(U(f)) represents U simulating the previ=
ous computation.
> > > > > > > > > > > > >=20
> > > > > > > > > > > > > There is no reason U(f) cannot be simulated by U.=
=C2=A0 U will have no knowledge
> > > > > > > > > > > > > that
> > > > > > > > > > > > > it
> > > > > > > > > > > > > is
> > > > > > > > > > > > > "simulating
> > > > > > > > > > > > > itself", and will just simulate what it is given.
> > > > > > > > > > > > >=20
> > > > > > > > > > > > >=20
> > > > > > > > > > > > > Mike.
> > > > > > > > > > > >=20
> > > > > > > > > > > > Sorry for not being clear on the UTM issue (I wante=
d to mean several things in
> > > > > > > > > > > > one
========== REMAINDER OF ARTICLE TRUNCATED ==========