scientific article; zbMATH DE number 3813599

zbMATH Open0515.03020MaRDI QIDQ3661558FDOQ3661558

Yurii Rogozhin

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

constructionsuniversal Turing machinetype symbols

Mathematics Subject Classification ID

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

Cited In (15)

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

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)