21.03.2015 Views

Darwin's Dangerous Idea - Evolution and the Meaning of Life

Darwin's Dangerous Idea - Evolution and the Meaning of Life

Darwin's Dangerous Idea - Evolution and the Meaning of Life

SHOW MORE
SHOW LESS

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

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

448 THE EMPEROR'S NEW MIND, AND OTHER FABLES<br />

seem to organize <strong>the</strong>mselves somewhat better than <strong>the</strong>y 'ought' to, just on<br />

<strong>the</strong> basis <strong>of</strong> blind-chance evolution <strong>and</strong> natural selection. It may well be<br />

that such appearances are quite deceptive. There seems to be something<br />

about die way that die laws <strong>of</strong> physics work, which allows natural selection<br />

to be a much more effective process than it would be with just arbitrary<br />

laws. [Penrose 1989, p. 416.]<br />

There could not be a clearer, more heartfelt expression <strong>of</strong> <strong>the</strong> hope for<br />

skyhooks than this. And though we cannot yet rule out "in principle" <strong>the</strong><br />

existence <strong>of</strong> a quantum-gravity skyhook, Penrose has not yet given us any<br />

reason to believe in one. If his <strong>the</strong>ory <strong>of</strong> quantum gravity were already a<br />

reality, it could well turn out to be a crane, but he hasn't got that far yet, <strong>and</strong> I<br />

doubt that he ever will. At least he's trying, however. He wants his <strong>the</strong>ory to<br />

provide a unified, scientific picture <strong>of</strong> how <strong>the</strong> mind works, not an excuse for<br />

declaring <strong>the</strong> mind to be an impenetrable Ultimate Source <strong>of</strong> <strong>Meaning</strong>. My<br />

own opinion is that <strong>the</strong> path he is now exploring—in particular, <strong>the</strong> possible<br />

quantum effects occurring in <strong>the</strong> microtubules <strong>of</strong> <strong>the</strong> cytoskeleton <strong>of</strong><br />

neurons, an idea enthusiastically promoted in Abisko by Stuart Hamer-<strong>of</strong>f—<br />

is a nonstarter, but that is not a topic for this occasion. (I can't resist raising<br />

one question for Penrose to ponder: if <strong>the</strong> magnificent quantum property<br />

lurks in <strong>the</strong> microtubules, does that mean that cockroaches have<br />

noncomputable minds, too? They have <strong>the</strong> same kind <strong>of</strong> microtubules we<br />

have.)<br />

If a Penrose-style quantum-gravity brain were truly capable <strong>of</strong> nonalgorithmic<br />

activity, <strong>and</strong> if we have such brains, <strong>and</strong> if our brains are <strong>the</strong>mselves<br />

<strong>the</strong> products <strong>of</strong> an algorithmic evolutionary process, a curious inconsistency<br />

emerges: an algorithmic process ( natural selection in its various levels <strong>and</strong><br />

incarnations) creates a nonalgorithmic subprocess or subroutine, turning <strong>the</strong><br />

whole process (evolution up to <strong>and</strong> including human ma<strong>the</strong>matician brains)<br />

into a nonalgorithmic process after all. This would be a cascade <strong>of</strong> cranes<br />

creating, eventually, a real skyhook! No wonder Penrose has his doubts<br />

about <strong>the</strong> algorithmic nature <strong>of</strong> natural selection. If it were, truly, just an<br />

algorithmic process at all levels, all its products should be algorithmic as<br />

well. So far as I can see, this isn't an inescapable formal contradiction;<br />

Penrose could just shrug <strong>and</strong> propose that <strong>the</strong> universe contains <strong>the</strong>se basic<br />

nuggets <strong>of</strong> nonalgorithmic power, not <strong>the</strong>mselves created by natural selection<br />

in any <strong>of</strong> its guises, but incorporatable by algorithmic devices as found<br />

objects whenever <strong>the</strong>y are encountered (like <strong>the</strong> oracles on <strong>the</strong> toadstools).<br />

Those would be truly nonreducible skyhooks.<br />

The position is, I guess, possible, but Penrose must face an embarrassing<br />

shortage <strong>of</strong> evidence for it. The physicist Hans Hansson came up with a good<br />

challenge in Abisko, comparing a perpetual-motion machine to a truthdetecting<br />

computer. Different sciences, Hansson noted, can <strong>of</strong>fer different<br />

The Phantom Quantum-Gravity Computer 449<br />

reliable shortcuts to verdicts about projects. If someone were to go to <strong>the</strong><br />

Swedish government with a plan to build a perpetual-motion machine (at<br />

government expense), Hansson would unhesitating testify, as a physicist,<br />

that this would be—would have to be—a waste <strong>of</strong> government money. It<br />

could not succeed, because physics has proven that a perpetual machine is<br />

flat impossible. Did Penrose think that he had <strong>of</strong>fered a similar sort <strong>of</strong> pro<strong>of</strong>?<br />

If some AI entrepreneur were to go to <strong>the</strong> government asking for money to<br />

build a ma<strong>the</strong>matical-truth-detecting machine, would Penrose be similarly<br />

willing to testify that such money would be wasted?<br />

To make <strong>the</strong> question more specific, consider some ra<strong>the</strong>r special varieties<br />

<strong>of</strong> ma<strong>the</strong>matical truth. It is well known that <strong>the</strong>re can be no all-purpose<br />

program that can examine any o<strong>the</strong>r program <strong>and</strong> tell whe<strong>the</strong>r or not it has<br />

an infinite loop in it, <strong>and</strong> hence will not stop if started. This is known as <strong>the</strong><br />

Halting Problem, <strong>and</strong> <strong>the</strong>re is a Gödel-style pro<strong>of</strong> that it is insoluble. ( This<br />

is one <strong>of</strong> <strong>the</strong> <strong>the</strong>orems Turing alluded to in his 1946 comment quoted at <strong>the</strong><br />

beginning <strong>of</strong> <strong>the</strong> chapter.) No program that is itself guaranteed to terminate<br />

can tell <strong>of</strong> every (finite) program whe<strong>the</strong>r or not it will terminate. But it<br />

might still be h<strong>and</strong>y—worth some serious money—to have a program<br />

around that was very, very good (if not perfect) at this task. Ano<strong>the</strong>r class <strong>of</strong><br />

interesting problems are known as Diophantine Equations, <strong>and</strong> it is known<br />

that <strong>the</strong>re is no algorithm guaranteed to solve all such equations. If our lives<br />

depended on it, should we spend a nickel on a program for solving Diophantine<br />

Equations "in general" or for checking for halting "in general"? (Remember:<br />

we shouldn't spend a nickel on perpetual-motion machines, even to<br />

save our lives, since it will be money wasted on an impossible task.)<br />

Penrose's answer was illuminating: if <strong>the</strong> c<strong>and</strong>idates for truth-checking<br />

"just somehow bubble up out <strong>of</strong> <strong>the</strong> ground," <strong>the</strong>n we would be wise to spend<br />

<strong>the</strong> money, but if some intelligent agent is <strong>the</strong> source <strong>of</strong> <strong>the</strong> c<strong>and</strong>idates <strong>and</strong><br />

gets to examine <strong>the</strong> program in our truth-checker, <strong>the</strong>n it can foil our<br />

algorithmic truth-checker by constructing just <strong>the</strong> "wrong" c<strong>and</strong>idate or<br />

c<strong>and</strong>idates—an equation unsolvable by it, or a program whose termination<br />

prospects will confound it. To make <strong>the</strong> distinction vivid, we can imagine<br />

that a space pirate, Rumpelstiltskin by name, is holding <strong>the</strong> planet hostage,<br />

but will release us unharmed if we can answer a thous<strong>and</strong> true-false<br />

questions about sentences <strong>of</strong> arithmetic. Should we put a human ma<strong>the</strong>matician<br />

on <strong>the</strong> witness st<strong>and</strong>, or a computer truth-checker devised by <strong>the</strong> best<br />

programmers? According to Penrose, if we hang our fate on <strong>the</strong> computer<br />

<strong>and</strong> let Rumpelstiltskin see <strong>the</strong> computer's program, he can devise an<br />

Achilles'-heel proposition that will foil our machine. (This would be true<br />

independendy <strong>of</strong> Godel's Theorem, if our program was a heuristic truthchecker,<br />

taking risks like any chess program.) But Penrose has given us no<br />

reason to believe that this isn't just as true <strong>of</strong> any human ma<strong>the</strong>maticians we<br />

might put on <strong>the</strong> witness st<strong>and</strong>. None <strong>of</strong> us is perfect, <strong>and</strong> even a team <strong>of</strong>

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

Saved successfully!

Ooh no, something went wrong!