3 ms·
I think they proved it grows with Ackermann function.
by trixthethird 1y ago
I think they proved it grows with Ackermann function.
- bjornsing 1y agoSounds implausible… Number of computational steps to find the shortest sequence maybe grows with Ackermann function. But length of the shortest sequence?
- trixthethird 1y agoI think you are right. I just read this article linked in the OP: https://www.quantamagazine.org/an-easy-sounding-problem-yields-numbers-too-big-for-our-universe-20231204/ https://www.quantamagazine.org/an-easy-sounding-problem-yiel...