Re: Do Write Once TM's Halt?
- From: torbenm@xxxxxxxxxxxxx (Torben Ægidius Mogensen)
- Date: Mon, 26 Feb 2007 11:19:13 +0100
"Russell Easterly" <logiclab@xxxxxxxxxxx> writes:
"Torben "Ægidius" Mogensen" <torbenm@xxxxxxxxxxxxx> wrote in message
news:7zejojhngm.fsf@xxxxxxxxxxxxxxxx
TM's don't have infinite tapes, they have unbounded tapes. The
important difference is that the tape at all times has finite support,
i.e., that it is blank outside a finite range (the size of which may
change during execution).
If you have a read-only tape, it too must be blank outside a certain
range, but this range doesn't change during execution. It is easy to
see that if a read-only TM with N states ever goes outside this range
by more than N spaces, it will not terminate. Hence, you can reduce
the termination problem to termination on a finite read-only tape,
which is, of course, trivial.
I was thinking of a tape like: 010101...
For example, a TM that halts if the input has an even number of 1's
would never halt on this input tape.
Such a TM would halt if the input only had a finite number of 1's on it.
A decision procedure needs finite input, and if your tape has infinite
support you can not give that tape to the decision procedure. So you
can only talk about decidability if you assume tapes with finite
non-blank cells, or at least tapes that have finite descriptions.
If you allow infinite tapes with finite descriptions, the decision
problem depends on which kind of descriptions you allow. It is, for
example, likely that you can decide termination if the tape
description is always of the form w^\omega, i.e., an infinite
repetition of a finite string w (such as your 010101..., which is
(01)^\omega). But if you allow descrition by arbitray TMs, the
problem is undecidable, not because of the complexity of the read-only
TMs but but because of the complexity of the general TMs used to
describe the input to the read-only TMs.
Torben
.
- References:
- Do Write Once TM's Halt?
- From: Russell Easterly
- Re: Do Write Once TM's Halt?
- From: TheGist
- Re: Do Write Once TM's Halt?
- From: r.e.s.
- Re: Do Write Once TM's Halt?
- From: Russell Easterly
- Re: Do Write Once TM's Halt?
- From: r.e.s.
- 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: Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?
- From: Russell Easterly
- Re: Do Write Once TM's Halt?
- From: Torben Ægidius Mogensen
- Re: Do Write Once TM's Halt?
- From: Russell Easterly
- Do Write Once TM's Halt?
- Prev by Date: Re: A restricted case of graph coloring, is this a known problem?
- Next by Date: revisit halting problem
- Previous by thread: Re: Do Write Once TM's Halt?
- Next by thread: Re: Do Write Once TM's Halt?
- Index(es):
Relevant Pages
|