Universality of Tag Systems with P = 2

DOI10.1145/321203.321206zbMATH Open0149.12405OpenAlexW2053756189MaRDI QIDQ5528151FDOQ5528151

Marvin L. Minsky, John Cocke

Publication date: 1964

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321203.321206

zbMATH Keywords

numerical analysis

Cited In (19)

• Parsimonious computational completeness
• Undecidability in diagonalizable algebras
• Undecidability and nonperiodicity for tilings of the plane
• Small fast universal Turing machines
• UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
• Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
• Small Universal Devices
• SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS
• On the complex behavior of simple tag systems -- an experimental approach
• The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
• The Complexity of Small Universal Turing Machines: A Survey
• Freezing 1-Tag Systems with States
• Decision problems for tag systems
• ON SMALL UNIVERSAL SPLICING SYSTEMS
• Title not available (Why is that?)
• Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
• The complexity of small universal Turing machines: A survey
• Context free normal systems and ETOL systems
• The Solvability of the Derivability Problem for One-Normal Systems

This page was built for publication: Universality of Tag Systems with P = 2

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