Re:Gödel's Incompleteness Theorem in Bash
by blackbrokkoli on Saturday February 26, 2022 @07:38AM
(#30477074)
Yes, definitely. But then the next task is just to solve the incompleteness problem on the level of the higher algorithm, because there must always be incompleteness.
Hofstaedter discusses this at length in his book Gödel, Escher, Bach if you are interested in this topic.
Mayhaps the issue is approaching the problem at the same dimensional level that the problem originated from. After all, humans can come at the problem from a higher cognitive level and, given enough time, resolve that an infinite loop is taking place, so the problem is not fundamentally unsolvable.
Einstein said, "No Problem Can Be Solved From The Same Level Of Consciousness That Created It", so it is feasible to assume that, say, a quantum computer running every possible iteration of an algorithm could easily identify which iterations of the algorithm's parameters would induce infinite loops by simple attrition.