Classifying the phase transition threshold for Ackermannian functions

Eran Omri, Andreas Weiermann

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

It is well known that the Ackermann function can be defined via diagonalization from an iteration hierarchy (of Grzegorczyk type) which is built on a start function like the successor function. In this paper we study for a given start function g iteration hierarchies with a sub-linear modulus h of iteration. In terms of g and h we classify the phase transition for the resulting diagonal function from being primitive recursive to being Ackermannian.

Original languageEnglish
Pages (from-to)156-162
Number of pages7
JournalAnnals of Pure and Applied Logic
Volume158
Issue number3
DOIs
StatePublished - Apr 2009
Externally publishedYes

Keywords

  • Ackermann function
  • Fast growing hierarchy
  • Phase transition
  • Threshold

Fingerprint

Dive into the research topics of 'Classifying the phase transition threshold for Ackermannian functions'. Together they form a unique fingerprint.

Cite this