Re:How close are computers to automating mathematical reason...
by umvi on Saturday August 29, 2020 @12:17PM
(#24317153)
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.
[ Parent
| on HN ]
Re:How close are computers to automating mathematical reason...
by sukilot on Saturday August 29, 2020 @02:35PM
(#24318359)
That'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".