Question

Will a small Turing machine (< 100 states) be found with behavior that cannot be characterized by mathematical proof?

Resolved :No

4 comments4

Total Forecasters62

Community Prediction25%

Make a Prediction

50%

community: 25%

Did this actually happen?No

Community Baseline Score

49.1

Community Peer Score

24.5

median 25.0%mean 27.8%

Authors:

converse

Opened:

Closes:

Resolves:

Computing and Math

Logic

Zermelo–Fraenkel set theory

Philosophy

Gödel's incompleteness theorems

Turing machine

In 2040, what will be the smallest value of the busy beaver function known to be undecidable in Peano arithmetic?

89.2

In 2040, what will be the smallest value of the busy beaver function known to be undecidable in ZFC set theory?

59.8

Is the halting problem for the Collatz Program computable?

92%

Comments

? comments