Exercises Multiple-choice questions Apps

Related books

Introduction to Theory of Computation Computers and Intractability: A Guide to the Theory of NP-Completeness Computational Complexity Computational Complexity: A Modern Approach Suggest a Book
0

Left move is decidable

Consider the problem of determining whether a Turing machine on an input $w$ ever attempts to move its head left at any point during its computation on $w$. Show that this problem is decidable.

Level:
Printable version LaTeX source
delete flag offensive retag edit

posted Jun 14 '12

kintali gravatar image Shiva Kintali flag of United States
691 1 6 25
http://www.cs.princeton.e...
POST AN EXERCISE POST MULTIPLE-CHOICE QUESTION

Stats

Posted: Jun 14 '12

Seen: 53 times

Last updated: Jun 14 '12