3 ms·
Knuth up arrows are computable functions, right? So they can't possibly grow faster than BB(n), let alone even faster-growing functions.
by FartyMcFarter 6y ago
Knuth up arrows are computable functions, right? So they can't possibly grow faster than BB(n), let alone even faster-growing functions.
- hnuser123456 6y agoMust be. Since Rayo(10000)>2↑↑↑65536 it seemed easy to spam a lot more up arrows there (10k of them), but the tide probably changes after n grows by another 95 orders of magnitude. Wonder where Rayo's function intersects mine.
- Aardwolf 6y agoRayo's function can describe the idea of "f(n)=n (n Knuth up arrows) n" with relatively few symbols - just like your post did using relatively few characters