Notes for the Lifebox, the Seashell, and the Soul - Rudy Rucker
Notes for the Lifebox, the Seashell, and the Soul - Rudy Rucker
Notes for the Lifebox, the Seashell, and the Soul - Rudy Rucker
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Notes</strong> <strong>for</strong> The <strong>Lifebox</strong>, <strong>the</strong> <strong>Seashell</strong>, <strong>and</strong> <strong>the</strong> <strong>Soul</strong>, by <strong>Rudy</strong> <strong>Rucker</strong><br />
cytoplasm would have an effect, as would <strong>the</strong> differing environments of <strong>the</strong>ir mo<strong>the</strong>rs’<br />
wombs. Even identical twins are different, if you take a magnifying glass to <strong>the</strong>m.<br />
Stimulants<br />
The stimulant issue is a scam, an irrelevant sideshow. A trick <strong>for</strong> suckers. Who ever<br />
got smarter by taking a pill?<br />
Television<br />
When I watch television, I feel that I really am seeing predictable computations.<br />
News, commercials, entertainment ⎯ it’s all so stereotyped, so lifeless, so utterly false.<br />
Nobody in real life acts like <strong>the</strong> people on TV, not even like <strong>the</strong> people on reality TV, <strong>for</strong> <strong>the</strong><br />
reality TV shows have been carefully edited to remove any trace of gnarly originality. If<br />
something unpredictable every happens on TV, <strong>the</strong> U. S. Congress angrily decries <strong>the</strong><br />
anomaly <strong>for</strong> months.<br />
Whoah <strong>the</strong>re, querulous geezer, <strong>the</strong>re’s more to society than TV.<br />
Quantum Computation <strong>and</strong> Predictability<br />
You know how sometimes you’re at a restaurant with five or six o<strong>the</strong>r people, <strong>and</strong> at<br />
<strong>the</strong> end of <strong>the</strong> meal everyone’s paying <strong>the</strong>ir share of <strong>the</strong> check, tossing hard-earned cash<br />
dollar bills down on <strong>the</strong> table. And <strong>the</strong>n <strong>the</strong>re’s always <strong>the</strong> one schmuck who loses control at<br />
<strong>the</strong> sight of <strong>the</strong> cash <strong>and</strong> grabs it all up <strong>and</strong> says <strong>the</strong>y’ll pay with <strong>the</strong>ir credit card (so <strong>the</strong>y can<br />
get air miles, put <strong>the</strong> meal on <strong>the</strong>ir expense account, avoid an auto teller fee, <strong>and</strong> come out<br />
ahead by pocketing most of <strong>the</strong> tip).<br />
To my way of thinking that’s what quantum computation is like, sitting at <strong>the</strong> table of<br />
computation <strong>the</strong>ory, scooping up <strong>the</strong> hard cash of in<strong>for</strong>med speculation, <strong>and</strong> claiming it can<br />
render any process predictable ⎯ if you’ll just trust its credit card.<br />
Gödel’s Second Incompleteness Theorem<br />
We can <strong>for</strong>malize <strong>the</strong> proof of Gödel’s First Incompleteness Theorem within <strong>the</strong><br />
<strong>for</strong>mal system F itself. To do this, we represent <strong>the</strong> sentence “F is consistent” by a sentence<br />
Con(F) of <strong>the</strong> <strong>for</strong>m “ ‘0=1’ is not a <strong>the</strong>orem of F.” By a mind-breaking feat of jumping out<br />
of <strong>the</strong> system, Gödel showed how one can in turn carry out this proof within <strong>the</strong> <strong>for</strong>mal<br />
system F itself, to establish as a <strong>the</strong>orem a statement of <strong>the</strong> <strong>for</strong>m “if Con(F) <strong>the</strong>n G f ” As a<br />
consequence, Gödel draws a Second Incompleteness Theorem.<br />
Gödel’s Second Incompleteness Theorem. If F is a consistent finitely given <strong>for</strong>mal<br />
system as powerful as arithmetic, <strong>the</strong>n <strong>the</strong> sentence Con(F) is undecidable <strong>for</strong> F.<br />
Chaitin’s Proof<br />
In order to describe Chaitin’s proof, I need ano<strong>the</strong>r definition relating to Turing<br />
machines that use <strong>the</strong> two symbols 0 <strong>and</strong> 1. Recall that in <strong>the</strong> Chapter One we discussed <strong>the</strong><br />
notion of adopting a fixed enumeration of <strong>the</strong>se Turing machines so that <strong>for</strong> an integer e, T e<br />
is a Turing machine. We can view T e as a kind of name <strong>for</strong> a string n by writing T e (0) = n to<br />
mean that <strong>the</strong> computation T e (0) halts <strong>and</strong> that when T e (0) halts, <strong>the</strong> binary expression <strong>for</strong><br />
p. 105