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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ren-ji Tao / rank
Normal rank
 
Property / author
 
Property / author: Ren-ji Tao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90072-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990157773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On primitive recursive wordfunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of the Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Predictably Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of recursive functions based on Ackermann's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rekursionszahlen und die Grzegorczyk-Hierarchie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 13 June 2024

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
    0 references