Deutsch   English   Français   Italiano  
<9b17aeea9022160306cc379fb3e1b55ac8944001.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: Sat, 17 May 2025 05:21:25 +0800
Organization: A noiseless patient Spider
Lines: 41
Message-ID: <9b17aeea9022160306cc379fb3e1b55ac8944001.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> <100776h$3m7q1$1@dont-email.me>
	 <1007n9d$3rb4n$1@dont-email.me> <10085nv$3m7q2$1@dont-email.me>
	 <10087on$3tu2i$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Fri, 16 May 2025 23:21:25 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="746533a96eeb3cf7efee6378a768121a";
	logging-data="4161695"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+lyNeUQEgLHxm4wfGHZ8sk"
User-Agent: Evolution 3.54.3 (3.54.3-1.fc41)
Cancel-Lock: sha1:23oyMaNicjw5tmDwvPSE5STTuUc=
In-Reply-To: <10087on$3tu2i$2@dont-email.me>
Bytes: 3259

On Fri, 2025-05-16 at 15:38 -0500, olcott wrote:
> On 5/16/2025 3:04 PM, Andy Walker wrote:
> > On 16/05/2025 16:57, Mike Terry wrote:
> > [I wrote:]
> > > > =C2=A0=C2=A0=C2=A0=C2=A0=C2=A0Minsky's "Computation" has on its fro=
nt cover [at least in the
> > > > Open University edition] and inside, as Fig. 7.2.9 on p142, a compl=
ete
> > > > UTM as a state-transition diagram.=C2=A0[...]
> >=20
> > > I found it on Amazon, and sure enough there on its front cover is
> > > the state transition diagram!=C2=A0 It sounds like a great book, but
> > > realistically I've already got too many books in my reading list...
> >=20
> > =C2=A0=C2=A0=C2=A0=C2=A0=C2=A0It /is/ a great book.=C2=A0 Get* it, and =
re-order your reading
> > list to put it first.=C2=A0 The only other CS book that I couldn't put
> > down was the Algol 68 Revised Report.
> >=20
> > =C2=A0=C2=A0 * Somewhat on the other hand, I see that it's $silly on Am=
azon
> > =C2=A0=C2=A0=C2=A0=C2=A0 and on Abe, so perhaps you should rather borro=
w it from a
> > =C2=A0=C2=A0=C2=A0=C2=A0 library.=C2=A0 In the UK, it was going to be a=
n Open University
> > =C2=A0=C2=A0=C2=A0=C2=A0 set book, with therefore guaranteed sales of m=
any thousands,
> > =C2=A0=C2=A0=C2=A0=C2=A0 But then the OU pulled out, the book was remai=
ndered, and I
> > =C2=A0=C2=A0=C2=A0=C2=A0 got a brand new copy for =C2=A3tiny.
> >=20
>=20
> This repository contains any material needed to run Marvin Minsky's=20
> Universal Turing Machine in Martin Ugarte's "Turing Machine Simulator"=
=20
> and to demonstrate its vulnerability as described by Pontus Johnson
> https://github.com/rozek/Universal-Turing-Machine
>=20

Thanks for the info. that reminds me of your famous words "read by rote"