Classes of recursive functions based on Ackermann's function

DOI10.2140/PJM.1965.15.1027MaRDI QIDQ2395748zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(16)

• Subrecursive hierarchies on Scott domains
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Plain bases for classes of primitive recursive functions
• Hierarchies of number-theoretic functions. I
• Complexity of algorithms and computations
• Unary primitive recursive functions
• 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
• Strictly primitive recursive realizability, I
• Some Hierarchies of Primitive Recursive Functions on Term Algebras
• A classification of the one-argument primitive recursive functions
• scientific article; zbMATH DE number 3623543 (Why is no real title available?)
• Pseudo-natural algorithms for finitely generated presentations of monoids and groups
• Herbrand analyses
• Complexity hierarchies beyond elementary
• On primitive recursive wordfunctions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2395748)