Classes of recursive functions based on Ackermann's function

DOI10.2140/PJM.1965.15.1027zbMATH Open0133.24903OpenAlexW1984196604MaRDI QIDQ2395748FDOQ2395748

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)

• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Subrecursive hierarchies on Scott domains
• 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
• Title not available (Why is that?)
• Herbrand analyses
• Pseudo-natural algorithms for finitely generated presentations of monoids and groups
• 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)