To consider any system Turing complete you have to extend it to having infinite memory. This is why all actual, non-theoretical computers are equivalent to finite state machines (or linear bounded automata [0]).

[0] https://en.wikipedia.org/wiki/Linear_bounded_automaton