The following pages link to (Q5586325):
Displaying 33 items.
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Small Turing machines and generalized busy beaver competition (Q703533) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Weighted systems of equations (Q1311966) (← links)
- Small universal Turing machines (Q1349852) (← links)
- Small deterministic Turing machines (Q1349854) (← links)
- Watson-Crick D0L systems: Generative power and undecidable problems. (Q1426440) (← links)
- An automaton group with undecidable order and Engel problems (Q1693094) (← links)
- Computationally universal P systems without priorities: Two catalysts are sufficient (Q1763714) (← links)
- Solvability of the halting problem for certain classes of Turing machines (Q1844660) (← links)
- Universal Petri net (Q2263192) (← links)
- The well-designed young mathematician (Q2389695) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Small fast universal Turing machines (Q2508974) (← links)
- Eine einfache universelle Turingmaschine in ALGOL 60 Simulation (Q2558861) (← links)
- Chaitin's omega and an algorithmic phase transition (Q2668248) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Small Universal Devices (Q2944894) (← links)
- Universality in Molecular and Cellular Computing (Q3195684) (← 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)
- How Redundant Is Your Universal Computation Device? (Q5191172) (← links)
- On Reasoning About Rings (Q5696925) (← links)
- On quasi-unilateral universal Turing machines (Q5941258) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)
