Exponential vs. Factorial

DOI10.2307/27642031zbMATH Open1132.11357OpenAlexW4236240737MaRDI QIDQ5452345FDOQ5452345

Authors: Daniel J. Velleman 

Publication date: 26 March 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/27642031

Recommendations

• Analytic combinatorics for a certain well-ordered class of iterated exponential terms
• scientific article; zbMATH DE number 4051925
• scientific article; zbMATH DE number 24563
• An elementary proof of the convergence of iterated exponentials
• On the rate of convergence of iterated exponentials

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic results on arithmetic functions (11N37) Rate of growth of arithmetic functions (11N56) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Connections of number theory and logic (11U99)

Cited In (2)

• How to compare power towers?
• Analytic combinatorics for a certain well-ordered class of iterated exponential terms

This page was built for publication: Exponential vs. Factorial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452345)