scientific article
From MaRDI portal
zbMath0515.03020MaRDI QIDQ3661558
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Related Items
Small universal Turing machines, Small deterministic Turing machines, On machines, universal by extensions, Small universal register machines, Non-erasing turing machines: A new frontier between a decidable halting problem and universality, Abstract geometrical computation. IV: Small Turing universal signal machines, On the complex behavior of simple tag systems -- an experimental approach, The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved, Tag systems and Collatz-like functions, Busy beaver competition and Collatz-like problems, Small Turing machines and generalized busy beaver competition, On quasi-unilateral universal Turing machines, How Redundant Is Your Universal Computation Device?, The complexity of small universal Turing machines: A survey, Frontier between decidability and undecidability: A survey
