Y
Hacker News
new
|
ask
|
show
|
jobs
by
trixthethird
433 days ago
I think they proved it grows with Ackermann function.
1 comments
bjornsing
433 days ago
Sounds implausible… Number of computational steps to find the shortest sequence maybe grows with Ackermann function. But length of the shortest sequence?
link
trixthethird
433 days ago
I think you are right. I just read this article linked in the OP:
https://www.quantamagazine.org/an-easy-sounding-problem-yiel...
link