Some rapidly growing functions

DOI10.1007/BF03023057zbMath0453.03049OpenAlexW3022666322MaRDI QIDQ1148900

Craig Smorynski

Publication date: 1980

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03023057

zbMATH Keywords

Ramsey theorembusy beaver function

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computability and recursion theory (03D99)

Related Items (5)

The scope of Gödel's first incompleteness theorem ⋮ An open formalism against incompleteness ⋮ Unnamed Item ⋮ Modular arithmetic of iterated powers ⋮ An inherently iterative algorithm for the Grzegorczyk hierarchy

Cites Work

• Some bounds for the Ramsey-Paris-Harrington numbers
• Rapidly growing Ramsey functions
• On Non-Computable Functions
• Hierarchies of number-theoretic functions. I

This page was built for publication: Some rapidly growing functions