Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines (Q3862403)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
scientific article

    Statements

    Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines (English)
    0 references
    0 references
    1979
    0 references
    universal Turing machine
    0 references
    two-dimensional tape
    0 references
    register-machines
    0 references
    networks of abstract automata
    0 references

    Identifiers