Article contents
The Ackermann functions are not optimal, but by how much?
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2010
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20180522083415083-0241:S0022481200002966:S0022481200002966_inline1.gif?pub-status=live)
- 1
- Cited by