We don't know whether every true statement about whole numbers can eventually be verified by a computer given unlimited time.
open
Mathematics & Logic
Some mathematical truths may be true but fundamentally unprovable within any given formal system, a possibility raised by Gödel's work but not fully mapped out for all classes of statements. This unresolved boundary shapes the philosophy of computation.
Team Humans Club. (2026). Problem WS01256: We don't know whether every true statement about whole numbers can eventually be verified by a computer given unlimited time.. World Solve. Retrieved 20 Jul 2026, from https://worldsolve.org/index.php?id=1256