16.04.2024 Views

Redefining Reality - The Intellectual Implications of Modern Science

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

is true, then it can’t be proven, but if it is false, then it would be<br />

provable. It is a contradiction if we adopt Russell’s view that<br />

mathematical truth and provability are the same thing.<br />

<br />

Because sentences about mathematics are mapped onto<br />

mathematical equations, then there would be truths <strong>of</strong><br />

mathematics that are unprovable. No mathematical system<br />

could be both complete—contain all truths—and sound—<br />

contain only truths. Gödel showed that logic wasn’t enough<br />

to justify mathematical truth.<br />

<br />

<br />

Turing took Gödel’s work and crossed it with what Blaise Pascal<br />

and Wilhelm von Leibniz had done in the 17 th century with<br />

computing machines. Turing believed that if there was a rule, then<br />

a machine could be built to follow the rule. In this way, he came up<br />

with the idea for what we now know as .<br />

If Gödel had succeeded in translating talk about math into<br />

mathematical equations and we had machines that could solve<br />

mathematical equations, then we could develop machines that<br />

could do pro<strong>of</strong>s. On the basis <strong>of</strong> this reasoning, Turing believed we<br />

could have machines do the abstract work for which we think we<br />

need human mathematicians.<br />

<br />

<br />

<br />

Just as this question became interesting, the British declared war<br />

on the Germans. <strong>The</strong> British were able to intercept German radio<br />

transmissions, but the Germans had developed the most complex<br />

encryption code ever created, the Enigma code. It was widely<br />

thought to be unbreakable.<br />

<strong>The</strong> code, however, was a translation problem similar to what<br />

Turing had seen in Gödel. Turing had worked on the question in<br />

terms <strong>of</strong> abstract machines. All he had to do was actually build one<br />

<br />

task, but he built it, and it worked. Turing’s machine cracked the<br />

German code.<br />

238

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!