in reply to
Re^4: Worst blog post ever on teaching programming
in thread Problematic post on teaching programming
Please explain where you got the infinitely long tape...
You are mistaken. There is no requirement in the definition of Turing machine that the tape be actually infinite in size. It merely needs to be unbounded. As long as an implementation, in its execution, doesn't exceed the limits of its "tape", there's no reason it can't be a Turing machine.
We're building the house of the future together.