Re: Do Write Once TM's Halt?

"Russell Easterly" <logiclab@xxxxxxxxxxx> writes:


I still don't have a proof the Halting Problem is decidable
for write once TM's, but I have a much better proof that
it is decidable for read only TM's.

A read-only TM is just a two-way finite automaton, so such questions
are trivial.

Torben
.