scientific article; zbMATH DE number 3813599

MaRDI QIDQ3661558zbMATH OpenFDO

Authors Yurii Rogozhin

Publication date 1982

zbMATH Keywords

constructionstype symbolsuniversal Turing machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Applications of computability and recursion theory (03D80)

Cited in

(15)

• The complexity of small universal Turing machines: A survey
• Small universal Turing machines
• Small deterministic Turing machines
• On machines, universal by extensions
• Small universal register machines
• Frontier between decidability and undecidability: A survey
• Tag systems and Collatz-like functions
• The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
• Non-erasing turing machines: A new frontier between a decidable halting problem and universality
• How Redundant Is Your Universal Computation Device?
• On quasi-unilateral universal Turing machines
• Abstract geometrical computation. IV: Small Turing universal signal machines
• On the complex behavior of simple tag systems -- an experimental approach
• Busy beaver competition and Collatz-like problems
• Small Turing machines and generalized busy beaver competition

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661558)