How the Slowest Computer Programs Illuminate Math’s Fundamental Limits

Re:How the Slowest Computer Programs Illuminate Math’s Funda... by FartyMcFarter on Friday December 11, 2020 @10:28AM (#25386780)

Knuth up arrows are computable functions, right? So they can't possibly grow faster than BB(n), let alone even faster-growing functions.

[ Parent | on HN ]

Re:How the Slowest Computer Programs Illuminate Math’s Funda... by hnuser123456 on Friday December 11, 2020 @10:37AM (#25386877)

Must 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.

[ Parent | on HN ]

Re:How the Slowest Computer Programs Illuminate Math’s Funda... by Aardwolf on Friday December 11, 2020 @11:19AM (#25387417)

Rayo'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

[ Parent | on HN ]