Classes of recursive functions based on Ackermann's function

DOI10.2140/PJM.1965.15.1027zbMath0133.24903OpenAlexW1984196604MaRDI QIDQ2395748

R. W. Ritchie

Publication date: 1965

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1965.15.1027

zbMATH Keywords

mathematical logic

Related Items (16)

Herbrand analyses ⋮ Hierarchies of number-theoretic functions. I ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Rekursionszahlen und die Grzegorczyk-Hierarchie ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strictly primitive recursive realizability, I ⋮ Complexity of algorithms and computations ⋮ Some Hierarchies of Primitive Recursive Functions on Term Algebras ⋮ On the computational power of automata with time or space bounded by Ackermann's or superexponential functions ⋮ Positive rudimentarity of the graphs of Ackermann and Grzegorczyk ⋮ Subrecursive hierarchies on Scott domains ⋮ A classification of the one-argument primitive recursive functions ⋮ On primitive recursive wordfunctions ⋮ Complexity Hierarchies beyond Elementary ⋮ Unary primitive recursive functions

This page was built for publication: Classes of recursive functions based on Ackermann's function