Kurt Gödel showed that even some very simple mathematical systems—arithmetic, for example—are inherently incomplete. They always contain statements that cannot be proved true or false within the system, even in principle. At about the same time (and by using essentially the same argument), the logician Alan Turing showed that even very simple computer programs can be undecidable: you can’t tell in advance whether the computer will reach an answer or not. In the 1960s and 1970s, physicists got much the same message from chaos theory: even very simple equations can produce results that are
...more