scientific article; zbMATH DE number 3305022

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

recursion theory, constructive mathematics

Related Items (33)

The Complexity of Small Universal Turing Machines: A Survey ⋮ Small universal Turing machines ⋮ Small deterministic Turing machines ⋮ The well-designed young mathematician ⋮ Universality in Molecular and Cellular Computing ⋮ Three ``quantum algorithms to solve 3-SAT ⋮ Chaitin's omega and an algorithmic phase transition ⋮ Small Universal Devices ⋮ A simple P-complete problem and its language-theoretic representations ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ Small networks of polarized splicing processors are universal ⋮ An automaton group with undecidable order and Engel problems ⋮ Small Universal Reversible Counter Machines ⋮ Complexity of algorithms and computations ⋮ Watson-Crick D0L systems: Generative power and undecidable problems. ⋮ On Reasoning About Rings ⋮ On the computational power of networks of polarized evolutionary processors ⋮ Tag systems and Collatz-like functions ⋮ Unnamed Item ⋮ Small universal accepting hybrid networks of evolutionary processors ⋮ Computationally universal P systems without priorities: Two catalysts are sufficient ⋮ Small Turing machines and generalized busy beaver competition ⋮ Universal Petri net ⋮ On quasi-unilateral universal Turing machines ⋮ How Redundant Is Your Universal Computation Device? ⋮ Small fast universal Turing machines ⋮ The complexity of small universal Turing machines: A survey ⋮ Average-Case Completeness in Tag Systems ⋮ Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines ⋮ Eine einfache universelle Turingmaschine in ALGOL 60 Simulation ⋮ Solvability of the halting problem for certain classes of Turing machines ⋮ Weighted systems of equations

This page was built for publication: