Super-exponentials nonprimitive recursive, but rudimentary

DOI10.1016/0020-0190(87)90205-5zbMath0632.03036DBLPjournals/ipl/Calude87OpenAlexW2071613174WikidataQ57001803 ScholiaQ57001803MaRDI QIDQ1095134

Cristian S. Calude

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90205-5

zbMATH Keywords

rudimentary functionAckermann's functionloop-programnonprimitive recursive function

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

Rudimentary relations and primitive recursion: A toolbox ⋮ Continued fractions of primitive recursive real numbers ⋮ The Road to Quantum Computational Supremacy ⋮ Fifty years of the spectrum problem: survey and new results

Cites Work

• A syntactical definition of the problem
• Equivalence of some Hierarchies of Primitive Recursive Functions
• Loop-programs and polynomially computable functions
• Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
• Monadic Elementary Formal Systems
• Rudimentary interpretation of two-tape turing computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Super-exponentials nonprimitive recursive, but rudimentary