3

What is example of functions that grow faster than the exponential functions and/or factorial functions?

3 Answers3

1

The busy beaver function can be shown to grow faster than any computable function.

Jemmy
  • 1,411
  • Thanks Jeremy .... Can you tell me proof of that? – JamieLolingner Nov 28 '13 at 15:29
  • @JamieLolingner I do not know the proof of it's asymptotic domination of computable functions. The fact that it is uncomputable follows from the fact if it were, it would solve the halting problem which is known to be undecidable. A different proof is given in that wiki article. The paper where there is a proof is Radó 1962. – Jemmy Nov 29 '13 at 02:01
  • I believe this is the paper: http://dl.acm.org/citation.cfm?id=321270 – Jemmy Nov 29 '13 at 02:05
1

Here there is an example: $$ x\rightarrow x^x $$

Ikki
  • 399
0

Another interesting functions that grow faster than exponential is Ackermann function $\mathrm{A}\left(m, n\right)$. Tetration $x \mapsto {^{n}x} = \underbrace{x^{x^{\cdot^{\cdot^{x}}}}}_n$ is a special case of Ackermann function. Tetration is to exponentiation what exponentiation is to multiplication. I.e. iterated exponentiation leads to tetration. A fun fact about tetration: $^44 > $ googolplex.

Computist
  • 525