4 ms·
There's also a thing called "the halting problem" which is related to this. Because without the halting problem you could solve any mathematical proof by simply
by umvi 6y ago
There's also a thing called "the halting problem" which is related to this. Because without the halting problem you could solve any mathematical proof by simply turning it into a computer program that brute forces the problem domain and calculating whether the the program will terminate or not. Of course, this is impossible.
- sukilot 6y agoThat's a bit backwards. The halting problem is a computer-flavored variant of Gödel's work. A very simple part -- it's essentially a computer program that says "The program that produced this string is lying".