When people say that a physical machine is Turing-complete, they invariably mean that it is equivalent to a linear-bounded automaton, precisely because an infin

When people say that a physical machine is Turing-complete, they invariably mean that it is equivalent to a linear-bounded automaton, precisely because an infinite tape isn't possible for us to construct.