3 ms·
We know that a computer can't verify all unknowable theorems. (Theory of Computation) But perhaps one can verify all provable theorems. I suspect that comput
by mathattack 12y ago
We know that a computer can't verify all unknowable theorems. (Theory of Computation) But perhaps one can verify all provable theorems.
I suspect that computers will struggle on the cleverness factor, where proof requires joining multiple fields of math, rather than just running through algebraic manipulation.
- lotsofmangos 12y agoBut perhaps one can verify all provable theorems. Could a computer verify that the domino problem is undecidable? The proof consists of translating the problem into non-halting universal turing machines. http://en.wikipedia.org/wiki/Wang_tile#Domino_problem http://en.wikipedia.org/wiki/Wang_tile#Domino_problem