Abstract
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of primitive recursive degrees.
Citation
H. Simmons. "The Ackermann functions are not optimal, but by how much?." J. Symbolic Logic 75 (1) 289 - 313, March 2010. https://doi.org/10.2178/jsl/1264433922
Information
