Re: Do Write Once TM's Halt?
- From: anw@xxxxxxxxxxxxxxxx (Dr A. N. Walker)
- Date: 21 Feb 2007 11:39:23 GMT
In article <ydydnXTc0vvEJUbYnZ2dnUVZ_vWtnZ2d@xxxxxxxxxxx>,
Russell Easterly <logiclab@xxxxxxxxxxx> wrote:
Does A Write Once TM Halt?[...]
Definition of a Write Once TM
This is not interestingly different from a "paper tape" TM
[you can punch holes in the tape, but not un-punch them]; and it
is relatively easy to construct a universal TM of this sort [see,
eg, "http://www.maths.nott.ac.uk/personal/anw/G12FCO/lect20.html",
near the end, but it's in plenty of books, eg Minsky].
So, "of course", the Halting Problem for it is just as
insoluble as the usual version.
--
Andy Walker, School of MathSci., Univ. of Nott'm, UK.
anw@xxxxxxxxxxxxxxxx
.
- References:
- Do Write Once TM's Halt?
- From: Russell Easterly
- Re: Do Write Once TM's Halt?
- From: Chris Smith
- Re: Do Write Once TM's Halt?
- From: Russell Easterly
- Re: Do Write Once TM's Halt?
- From: Russell Easterly
- Do Write Once TM's Halt?
- Prev by Date: Re: Do Write Once TM's Halt?
- Next by Date: Re: Worst-case Performance of Insertion Sort
- Previous by thread: Re: Do Write Once TM's Halt?
- Next by thread: Relation problem for homework
- Index(es):