Elementary functions and loop programs
From MaRDI portal
Publication:1903128
DOI10.1305/ndjfl/1040408609zbMath0831.03021MaRDI QIDQ1903128
Publication date: 20 February 1996
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1040408609
rudimentary predicates; classification of LOOP programs of limited complexity; hierarchy of elementary predicates; hierarchy of Kalmàr elementary functions on integers
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03D15: Complexity of computation (including implicit computational complexity)
03D10: Turing machines and related notions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive rudimentarity of the graphs of Ackermann and Grzegorczyk
- Elementary realizability
- Theory of Formal Systems. (AM-47)
- Classes of Predictably Computable Functions
- The Structure of Loop Programs and Subrecursive Hierarchies
- The bounded arithmetic hierarchy
- The Equivalence of Different Hierarchies of Elementary Functions
- Subrecursive Programming Languages, Part I
- Concatenation as a basis for arithmetic