|
Turing complete, Turing equivalent, computationally universal | a set of data-manipulation rules which can be used to simulate any single-taped Turing machine; informally, to mean any real-world general-purpose computer or computer language can approximately simulate any other such language |