Pages that link to "Item:Q2508974"
From MaRDI portal
The following pages link to Small fast universal Turing machines (Q2508974):
Displaying 21 items.
- Fractal dimension versus process complexity (Q504699) (← 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)
- Generic case completeness (Q736607) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Computation with finite stochastic chemical reaction networks (Q1035715) (← links)
- Some small self-describing Turing machines (Q1279903) (← links)
- Small universal Turing machines (Q1349852) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
- Yurii Rogozhin's contributions to the field of small universal Turing machines (Q2805458) (← links)
- Computational classification of cellular automata (Q2869784) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- MINSKY'S SMALL UNIVERSAL TURING MACHINE (Q4006815) (← links)
- (Q4432088) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- (Q5155665) (← links)
- How Redundant Is Your Universal Computation Device? (Q5191172) (← links)
- Four Small Universal Turing Machines (Q5901452) (← links)
- Decidability for Sturmian words (Q6597962) (← links)
