Pages that link to "Item:Q5528151"
From MaRDI portal
The following pages link to Universality of Tag Systems with <i>P</i> = 2 (Q5528151):
Displayed 19 items.
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Context free normal systems and ETOL systems (Q1837541) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- Undecidability and nonperiodicity for tilings of the plane (Q2540183) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Small Universal Devices (Q2944894) (← links)
- Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States (Q2945880) (← links)
- SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS (Q3076606) (← links)
- Undecidability in diagonalizable algebras (Q4338316) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- (Q5061519) (← links)
- UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS (Q5501771) (← links)
- The decision problem for formulas in prenex conjunctive normal form with binary disjunctions (Q5607225) (← links)
- The Solvability of the Derivability Problem for One-Normal Systems (Q5608015) (← links)
- Decision problems for tag systems (Q5663844) (← links)
- Freezing 1-Tag Systems with States (Q6204127) (← links)