Universality of Tag Systems with P = 2

DOI10.1145/321203.321206zbMath0149.12405OpenAlexW2053756189MaRDI QIDQ5528151

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

Related Items (19)

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

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