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

From MaRDI portal
Revision as of 12:16, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





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