Computing Bounds from Arithmetical Proofs

Abstract

We explore the role of the function a + 2, and its generalizations to higher number classes, in providing complexity bounds for the provably computable functions across a broad spectrum of theories, based on a “predicative” induction scheme and ranging in strength between polynomial-time arithmetic and Π11-CA0. The resulting “fast-growing” sub-recursive… (More)

Topics

  • Presentations referencing similar topics