The complexity of small universal Turing machines: A survey
From MaRDI portal
(Redirected from Publication:1004087)
Recommendations
- The Complexity of Small Universal Turing Machines: A Survey
- The Complexity of Small Universal Turing Machines
- Small universal Turing machines
- Small Semi-Weakly Universal Turing Machines
- Small Semi-weakly Universal Turing Machines
- Small Weakly Universal Turing Machines
- Small fast universal Turing machines
- scientific article; zbMATH DE number 3997169
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 4195207 (Why is no real title available?)
- scientific article; zbMATH DE number 3813599 (Why is no real title available?)
- scientific article; zbMATH DE number 3487424 (Why is no real title available?)
- scientific article; zbMATH DE number 3497877 (Why is no real title available?)
- scientific article; zbMATH DE number 3503212 (Why is no real title available?)
- scientific article; zbMATH DE number 3564949 (Why is no real title available?)
- scientific article; zbMATH DE number 522863 (Why is no real title available?)
- scientific article; zbMATH DE number 1114344 (Why is no real title available?)
- scientific article; zbMATH DE number 1138300 (Why is no real title available?)
- scientific article; zbMATH DE number 1746682 (Why is no real title available?)
- scientific article; zbMATH DE number 2086632 (Why is no real title available?)
- scientific article; zbMATH DE number 2087234 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 806589 (Why is no real title available?)
- scientific article; zbMATH DE number 806613 (Why is no real title available?)
- scientific article; zbMATH DE number 3267347 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
- A Universal Reversible Turing Machine
- Busy beaver competition and Collatz-like problems
- DNA Computing
- Formal Reductions of the General Combinatorial Decision Problem
- Four Small Universal Turing Machines
- Frontier between decidability and undecidability: A survey
- Logical Reversibility of Computation
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- Membrane Computing
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
- On Formalisms for Turing Machines
- On machines, universal by extensions
- On quasi-unilateral universal Turing machines
- P-completeness of Cellular Automaton Rule 110
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones
- Quasilinear cellular automata
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Recursive unsolvability of a problem of Thue
- Small Semi-weakly Universal Turing Machines
- Small Turing machines and generalized busy beaver competition
- Small deterministic Turing machines
- Small fast universal Turing machines
- Small universal Turing machines
- Solvability of the halting problem for certain classes of Turing machines
- Statistical mechanics of cellular automata
- Study of Limits of Solvability in Tag Systems
- Surprising areas in the quest for small universal devices
- Tag systems and lag systems
- The Complexity of Small Universal Turing Machines
- The Solvability of the Halting Problem for 2-State Post Machines
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved
- Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
- Undecidability and nonperiodicity for tilings of the plane
- Universality in elementary cellular automata
- Universality of Tag Systems with P = 2
Cited in
(22)- Polarization: a new communication protocol in networks of bio-inspired processors
- scientific article; zbMATH DE number 3997169 (Why is no real title available?)
- Maurice Margenstern's contributions to the field of small universal Turing machines
- A concrete view of Rule 110 computation
- P-completeness of Cellular Automaton Rule 110
- Universality in elementary cellular automata
- Tag systems and the complexity of simple programs
- The Complexity of Small Universal Turing Machines
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Abstract geometrical computation. IV: Small Turing universal signal machines
- Small networks of polarized splicing processors are universal
- Small universal reversible counter machines
- Yurii Rogozhin's contributions to the field of small universal Turing machines
- Nontrivial turmites are Turing-universal
- The Complexity of Small Universal Turing Machines: A Survey
- Small Turing universal signal machines
- Small Weakly Universal Turing Machines
- Surprising areas in the quest for small universal devices
- Analysis and design of molecular machines
- Rule primality, minimal generating sets and Turing-universality in the causal decomposition of elementary cellular automata
- Machines, Computations, and Universality
- Looking for small efficient P systems
This page was built for publication: The complexity of small universal Turing machines: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004087)
