Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T12:33:49.779Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 March 2014

H. Simmons*
Affiliation:
School of Mathematics, The University, Manchester M13 9PL, England, E-mail: hsimmons@manchester.ac.uk

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable