Deutsch English Français Italiano |
<3b177909de383fcf209cfb9ff81fe2f118640578.camel@gmail.com> View for Bookmarking (what is this?) Look up another Usenet article |
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: Thu, 15 May 2025 01:33:50 +0800 Organization: A noiseless patient Spider Lines: 36 Message-ID: <3b177909de383fcf209cfb9ff81fe2f118640578.camel@gmail.com> References: <1e4f1a15826e67e7faf7a3c2104d09e9dadc6f06.camel@gmail.com> <1002akp$2i4bk$2@dont-email.me> <479eebef3bd93e82c8fe363908b254b11d15a799.camel@gmail.com> <1002j0r$2k04b$1@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 19:33:51 +0200 (CEST) Injection-Info: dont-email.me; posting-host="fb98f5982c5f4b769d69fe2bc947602b"; logging-data="2756555"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18cYxUbAq3K/3RXLx692ca0" User-Agent: Evolution 3.54.3 (3.54.3-1.fc41) Cancel-Lock: sha1:tVP1mBKjDFGq9UzaqTYOSqOP1H8= In-Reply-To: <1002j0r$2k04b$1@dont-email.me> Bytes: 2264 On Wed, 2025-05-14 at 18:14 +0100, Richard Heathfield wrote: > On 14/05/2025 17:43, 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 its= elf): > > > >=20 > > > > void D() { > > > > =C2=A0=C2=A0 D(); > > > > } > > > >=20 > > > > Easy? > > > >=20 > > > >=20 > > >=20 > > > That is not a TM. > >=20 > > It is a C program that exists. Therefore, there must be a equivalent TM= .. > >=20 > > > To make a TM that references itself 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 > It doesn't have to simulate anything. All it has to do is to=20 > restore the state into which the programmer wishes to recurse. So, when you say "A UTM simulates X", it means=C2=A0'the UTM' doesn't have = to do anything. So, 'UTM' is human (e.g. you), not a real TM? > I've already shown how this can be done. Where?