M

🚀Metaculus Open-Source Rewrite is Live!

You're now enjoying a rewritten, open-source Metaculus, with a range of improvements and new opportunities for collaboration. Go here to learn more!

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 Prediction25%

Make a Prediction

community: 25%

Did this actually happen?No

median 25.0%mean 27.8%
0%10%20%30%40%50%60%70%80%90%100%
Authors:
converse
Opened:
Closes:
Resolves:
Computing and Math
Logic
Mathematics
Zermelo–Fraenkel set theory
Computer science
Philosophy
Gödel's incompleteness theorems
Turing machine

Comments

? comments