The Ackermann function in elementary algebraic geometry

Abstract

We can equivalently present this by the recursion equations f1(n) = 2n, fk+1(1) = fk(1), fk+1(n+1) = fk(fk+1(n)), where k,n ≥ 1. We define A(k,n) = fk(n).

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
175 (#136,992)

6 months
175 (#20,966)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references