On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:41, 31 January 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
