The Complexity of Small Universal Turing Machines: A Survey (Q2891384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Solvability of the Halting Problem for 2-State Post Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Tag Systems with <i>P</i> = 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of Limits of Solvability in Tag Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Formalisms for Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for Computations of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Langton's ant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Halting Problem of one State Turing Machines with <i>n</i>‐Dimensional Tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small deterministic Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Studies of Turing Machine Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surprising Areas in the Quest for Small Universal Devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontier between decidability and undecidability: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quasi-unilateral universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Busy beaver competition and Collatz-like problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Turing machines and generalized busy beaver competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasilinear cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Universal Reversible Turing Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Weakly Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small fast universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four Small Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Semi-weakly Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four Small Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four states are enough! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability of the halting problem for certain classes of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On machines, universal by extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Reductions of the General Combinatorial Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Unsolvability of a problem of Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and nonperiodicity for tilings of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINSKY'S SMALL UNIVERSAL TURING MACHINE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tag systems and lag systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of small universal Turing machines: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Semi-Weakly Universal Turing Machines / rank
 
Normal rank

Latest revision as of 08:04, 5 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Small Universal Turing Machines: A Survey
scientific article

    Statements

    The Complexity of Small Universal Turing Machines: A Survey (English)
    0 references
    0 references
    0 references
    15 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers