Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 alpha 4/3/85; site ukma.UUCP
Path: utzoo!watmath!clyde!cbosgd!ukma!drew
From: drew@ukma.UUCP (Andrew Lawson)
Newsgroups: net.ai,net.philosophy
Subject: Re: A halting problem
Message-ID: <2610@ukma.UUCP>
Date: Sat, 1-Feb-86 14:09:24 EST
Article-I.D.: ukma.2610
Posted: Sat Feb  1 14:09:24 1986
Date-Received: Sun, 2-Feb-86 02:51:59 EST
References: <2175@aecom.UUCP> <14551@rochester.UUCP> <3978@kestrel.ARPA> <438@faron.UUCP> <4101@kestrel.ARPA> <633@harvard.UUCP>
Reply-To: drew@ukma.UUCP (Andrew Lawson)
Distribution: net
Organization: U of KY Mathematical Sciences
Lines: 16
Xref: watmath net.ai:3247 net.philosophy:4037

In article <633@harvard.UUCP> draves@harvard.UUCP (Richard draves) writes:
>Say that a Turing Machine is "in an infinite loop" if its
>computation repeats a configuration (and hence doesn't halt).
>
	But what about a Turing Machine which avoids halting
by going to state k -- a state with the following characteristics
	Regardless of what is read:
		- write 1
		- move the head right
		- go to state k
You will see that the tape configureations will never repeat.

-- 
Drew Lawson

"Parts is parts."