There is a problem I can't solve: Assume n is an integer. Prove that there exists a recursive language such that there is no Turing Machine which accepts it and makes a maximum of n steps for every input. I'll be glad to receive hints. Thanks!
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Hint: In $n$ steps, a Turing machine can read from at most the first $n$ cells. So any Turing machine with this property depends only on the contents of the first $n$ cells of the input tape.