On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662)

From MaRDI portal
Revision as of 14:31, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
scientific article

    Statements

    On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (English)
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity classes
    0 references
    partial functions
    0 references
    total functions
    0 references
    Ackermann's function
    0 references
    Grzegorczyk hierarchy
    0 references
    0 references
    0 references