Maurice Margenstern's contributions to the field of small universal Turing machines
From MaRDI portal
Publication:4982992
Recommendations
Cites work
- Formal Reductions of the General Combinatorial Decision Problem
- Four Small Universal Turing Machines
- Frontier between decidability and undecidability: A survey
- scientific article; zbMATH DE number 5885061 (Why is no real title available?)
- scientific article; zbMATH DE number 3503212 (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 1746682 (Why is no real title available?)
- scientific article; zbMATH DE number 2087234 (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 3273195 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality
- On quasi-unilateral universal Turing machines
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Small deterministic Turing machines
- Small fast universal Turing machines
- Small Turing machines and generalized busy beaver competition
- Small universal Turing machines
- Solvability of the halting problem for certain classes of Turing machines
- The 3x + 1 Problem and Its Generalizations
- The Complexity of Small Universal Turing Machines: A Survey
- The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
- Universality in elementary cellular automata
- Universality of Tag Systems with P = 2
Cited in
(2)
This page was built for publication: Maurice Margenstern's contributions to the field of small universal Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982992)