> These systems are Turing-complete when you add an external tape using I/O, but so is a finite-state machine!

There is a related concept called Bounded-Storage Machine for memory-bounded TM-like abstractions. This computation model is very common with esoteric programming languages. http://esolangs.org/wiki/Bounded-storage_machine