The Ackermann functions are not optimal, but by how much?

DOI10.2178/JSL/1264433922zbMath1192.03013OpenAlexW2076743759MaRDI QIDQ5190202

Harold Simmons

Publication date: 15 March 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1264433922

zbMATH Keywords

Ackermann jumpprimitive recursive degree

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Proof lengths for instances of the Paris-Harrington principle

Cites Work

• Unnamed Item
• Konstruktion nichtrekursiver Funktionen
• Hierarchies of number-theoretic functions. I
• Hierarchies of number-theoretic functions II
• Recursion and double recursion

This page was built for publication: The Ackermann functions are not optimal, but by how much?