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

From MaRDI portal
Revision as of 03:24, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    complexity classes
    0 references
    partial functions
    0 references
    total functions
    0 references
    Ackermann's function
    0 references
    Grzegorczyk hierarchy
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references