This article was originally published with the title “ The Foundations of Mathematics ” in Scientific American Magazine Vol. 211 No. 3 (September 1964), p. 112 doi:10.1038 ...
Mathematical proofs based on a technique called diagonalization can be relentlessly contrarian, but they help reveal the limits of algorithms. How hard is it to prove that problems are hard to solve?
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback