RE: [math-fun] Most influential mathematician?

Such a computer program would be as intricate as the proofs it is expected to verify, and is subject to the same human error. There cannot be certainty of correctness of a proof without certainty of the correctness of the proof-checking software. Could the program check itself?

this reminds me to the halting-problem, which is known to be not solveable... --Chris