4 comments
62 forecasters
Will a small Turing machine (< 100 states) be found with behavior that cannot be characterized by mathematical proof?
25%chance
ResolvedNo
The community gave this a 25% chance, and it resolved No.
Forecast Timeline
Authors:
Opened:Aug 8, 2016
Closes:Dec 1, 2016
Resolved:Jul 17, 2017
Spot Scoring Time:Aug 9, 2016
Learn more about Metaculus NewsMatch
In 2040, what will be the smallest value of the busy beaver function known to be undecidable in Peano arithmetic?
68
(26 - 191)
68
(26 - 191)
12 forecasters
In 2040, what will be the smallest value of the busy beaver function known to be undecidable in ZFC set theory?
78.8
(34.8 - 193)
78.8
(34.8 - 193)
13 forecasters
Is the halting problem for the Collatz Program computable?
92% chance
84