2010Journal of Symbolic LogicRequires access

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

Harold Simmons

Open publisher page 1 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Ackermann function, Function (biology), Computer science, Mathematics, Inverse, Biology, Geometry, Evolutionary biology

Related papers

Back to paper searchBrowse research topicsOriginal source
The Ackermann functions are not optimal, but by how much? — Research Paper | ScholarLens