article · Journal of Symbolic Logic · 2010

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

Cited by 1Abstract and details only

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.

Cite this paper

APA 7

Simmons, H. (2010). The Ackermann functions are not optimal, but by how much? Journal of Symbolic Logic, 75(1), 289–313. https://doi.org/10.2178/jsl/1264433922

MLA 9

Simmons, Harold. “The Ackermann functions are not optimal, but by how much?” Journal of Symbolic Logic, vol. 75, no. 1, 2010, pp. 289–313, https://doi.org/10.2178/jsl/1264433922.

Chicago

Simmons, Harold. 2010. “The Ackermann functions are not optimal, but by how much?” Journal of Symbolic Logic 75 (1): 289–313. https://doi.org/10.2178/jsl/1264433922.

Harvard

Simmons, H. (2010) ‘The Ackermann functions are not optimal, but by how much?’, Journal of Symbolic Logic, 75(1), pp. 289–313. Available at: https://doi.org/10.2178/jsl/1264433922.

BibTeX

@article{simmons2010ackermann,
  title = {{The Ackermann functions are not optimal, but by how much?}},
  author = {Simmons, Harold},
  journal = {Journal of Symbolic Logic},
  volume = {75},
  number = {1},
  pages = {289--313},
  year = {2010},
  doi = {10.2178/jsl/1264433922}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.