Re: Questions on turing machine problems
- From: Tim Tyler <seemysig@xxxxxxxxxxxxxx>
- Date: Tue, 06 May 2008 19:26:09 +0100
polymedes wrote:
1) I'm trying to understand the following problem: let M_1 and M_2
two turing machines with common input alphabet and a given string x. Is
there a particular step in which the two machines will write the same
symbol on the tape?
These TMs will probably write the same symbol on the tape at
/every/ step - unless you explain in what way they differ.
--
__________
|im |yler http://timtyler.org/ tim@xxxxxxxxxxx Remove lock to reply.
.
- Follow-Ups:
- Re: Questions on turing machine problems
- From: polymedes
- Re: Questions on turing machine problems
- References:
- Questions on turing machine problems
- From: polymedes
- Questions on turing machine problems
- Prev by Date: Re: How can I tell if F is a string or if it is a number?
- Next by Date: Re: Questions on turing machine problems
- Previous by thread: Questions on turing machine problems
- Next by thread: Re: Questions on turing machine problems
- Index(es):
Relevant Pages
|
