Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Alan Turings Wirkung in Münster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small deterministic Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284259 / 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: P-completeness of Cellular Automaton Rule 110 / 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: Solvability of the halting problem for certain classes of Turing machines / 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: Q5557935 / rank
 
Normal rank

Latest revision as of 19:22, 8 July 2024

scientific article
Language Label Description Also known as
English
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
scientific article

    Statements

    Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2014
    0 references
    polynomial time
    0 references
    computational complexity
    0 references
    small universal Turing machines
    0 references
    Wang's B machine
    0 references
    non-erasing Turing machines
    0 references
    models of computation
    0 references

    Identifiers