Re: UTM

On Thu, 09 Mar 2006 15:32:34 GMT, "Peter T. Daniels"
<grammatim@xxxxxxxxxxxxxxxx> wrote in
<news:44104A93.491C@xxxxxxxxxxxxxxxx> in sci.lang:

Brian M. Scott wrote:

On 7 Mar 2006 23:56:53 -0800, bl4z3r <bl4z3r06@xxxxxxxxx>
wrote in
<news:1141804613.425814.158870@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>
in sci.lang:

If we have a TM M and we want to simulate another TM with a longer
alphabet over {0,1}*. Are we suppose to do that with a UTM that has
3-Tapes?

First, sci.lang deals with natural languages; for a question
about Turing machines you probably want one of the comp.*
groups, or possibly sci.math or sci.logic. (But the
question as you've asked it can probably be answered only by
the person who assigned it.)

Surely the professor didn't assign a homework problem that can't be
answered by anyone in the class who's been paying attention?

The OP appears to be asking in effect what type of solution
is permitted, though he may simply be asking whether a
particular approach is feasible and expressing himself
poorly.

Brian
.

Relevant Pages