Deutsch English Français Italiano |
<479eebef3bd93e82c8fe363908b254b11d15a799.camel@gmail.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!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: Thu, 15 May 2025 00:43:04 +0800 Organization: A noiseless patient Spider Lines: 22 Message-ID: <479eebef3bd93e82c8fe363908b254b11d15a799.camel@gmail.com> References: <1e4f1a15826e67e7faf7a3c2104d09e9dadc6f06.camel@gmail.com> <1002akp$2i4bk$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Injection-Date: Wed, 14 May 2025 18:43:06 +0200 (CEST) Injection-Info: dont-email.me; posting-host="fb98f5982c5f4b769d69fe2bc947602b"; logging-data="2729153"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/7f83IwZWaTeyNZZMspMIU" User-Agent: Evolution 3.54.3 (3.54.3-1.fc41) Cancel-Lock: sha1:dLGqLlnPZSCpPo+zaFGWop0/UGA= In-Reply-To: <1002akp$2i4bk$2@dont-email.me> Bytes: 1584 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 D(); > > } > >=20 > > Easy? > >=20 > >=20 >=20 > That is not a TM. It is a C program that exists. Therefore, there must be a equivalent TM. > To make a TM that references itself the closest > thing is a UTM that simulates its own TM source-code. How does a UTM simulate its own TM source-code?