A Turing Machine Question
- by Hellnar
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.