As someone points out, no system we use is really turing complete, since no syst...

As someone points out, no system we use is really turing complete, since no system has truly infinite memory.

In most systems with finite memory, the halting problem is solvable anyway.

(this includes linear bounded automatons and deterministic/non-deterministic machines with finite memory).

It's just going to take a long ass time.