Question

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

Resolved:No
8
4
Total Forecasters62
Community Prediction
25%
(15% - 36%)

Make a Prediction

50%
community: 25%

Did this actually happen?No

Community Baseline Score
49.1
Community Peer Score
24.5
Authors:
converse
Opened:Aug 8, 2016
Closes:Dec 1, 2016
Resolves:Jul 17, 2017
Spot Scoring Time:Aug 9, 2016
Computing and Math
2016-2017 Leaderboard
Logic
Zermelo–Fraenkel set theory
Philosophy
Gödel's incompleteness theorems
Turing machine