The following pages link to Small universal Turing machines (Q1349852):
Displaying 47 items.
- Three small universal spiking neural P systems (Q487986) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Abstract geometrical computation. IV: Small Turing universal signal machines (Q616493) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- Real recursive functions and their hierarchy (Q706790) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- Reversible computing and cellular automata -- a survey (Q924686) (← links)
- A DNA computing inspired computational model (Q953543) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- Direct constructions of universal extended H systems. (Q1401272) (← links)
- DNA computing based on splicing: Universality results (Q1575909) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality (Q1672012) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Computational universality and efficiency in morphogenetic systems (Q2104142) (← links)
- Spiking neural P systems with polarizations and rules on synapses (Q2205254) (← links)
- Universal Petri net (Q2263192) (← links)
- The stability of the deterministic Skorokhod problem is undecidable (Q2339927) (← links)
- Spiking neural P systems with rules on synapses (Q2440833) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Analog computation beyond the Turing limit (Q2497879) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- Computing by Floating Strings (Q2864199) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Small Universal Devices (Q2944894) (← links)
- SMALL UNIVERSAL TVDH AND TEST TUBE SYSTEMS (Q3076606) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← links)
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved (Q4349780) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- ON SMALL UNIVERSAL SPLICING SYSTEMS (Q4923288) (← links)
- Surprising Areas in the Quest for Small Universal Devices (Q4982064) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- (Q5061519) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Small Universal Reversible Counter Machines (Q5112183) (← links)
- Encodings of Turing machines in linear logic (Q5139286) (← links)
- How Redundant Is Your Universal Computation Device? (Q5191172) (← links)
- A Note on Computation MTs with Time in Instructions or with Tapes of Fixed Length (Q5859289) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)
- Integer Weighted Automata on Infinite Words (Q6169963) (← links)
- Morphogenetic computing: computability and complexity results (Q6177192) (← links)
