A Turing Machine Question

Posted by Hellnar on Stack Overflow See other posts from Stack Overflow or by Hellnar
Published on 2010-03-24T14:10:40Z Indexed on 2010/03/24 14:13 UTC
Read the original article Hit count: 425

Filed under:
|

Greetings,

I have been struggling to find a question regarding this theoretical question, even tho it is not directly a programming question, I believe it is really related.

Assume a type of Turing machine which cannot have more than 1000 squares. What would be the relationship between the set of such type of recognizable languages and set of normal recognizable languages.

© Stack Overflow or respective owner

Related posts about turing-machines

Related posts about theory