But perhaps one can verify all provable theorems. Could a computer verify that the domino problem is undecidable? The proof consists of translating the problem

But 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