Translator Disclaimer
March 2010 The Ackermann functions are not optimal, but by how much?
H. Simmons
J. Symbolic Logic 75(1): 289-313 (March 2010). DOI: 10.2178/jsl/1264433922

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

Download 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

Published: March 2010
First available in Project Euclid: 25 January 2010

zbMATH: 1192.03013
MathSciNet: MR2605895
Digital Object Identifier: 10.2178/jsl/1264433922

Subjects:
Primary: 03D20, 03D30

Rights: Copyright © 2010 Association for Symbolic Logic

JOURNAL ARTICLE
25 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.75 • No. 1 • March 2010
Back to Top