The complexity of small universal Turing machines: A survey (Q1004087): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.09.051 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063572548 / rank
 
Normal rank
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: 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: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / 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: 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: Non-erasing turing machines: A new frontier between a decidable halting problem and universality / 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: 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: 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: Four Small Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small fast 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 Semi-weakly Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737167 / 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: Q4083406 / 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: Q3661558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4383577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane Computing / 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 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.09.051 / rank
 
Normal rank

Latest revision as of 12:16, 10 December 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
    2 March 2009
    0 references
    small universal Turing machines
    0 references
    computational complexity
    0 references
    polynomial time
    0 references
    simulation
    0 references
    tag systems
    0 references
    cellular automata
    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
    0 references
    0 references

    Identifiers