<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Just a Gwai Lo</title>
  <subtitle>fun within prescribed limits</subtitle>
  <link rel="alternate" type="text/html" href="http://justagwailo.com/filter/2006/08/16/lifebox-chapter-1"/>
  <link rel="self" type="application/atom+xml" href="http://justagwailo.com/node/6275/atom/feed"/>
  <id>http://justagwailo.com/node/6275/atom/feed</id>
  <updated>2007-08-15T09:49:33-07:00</updated>
  <entry>
    <title>The Lifebox, The Seashell, and the Soul by Rudy Rucker: Chapter 1: Computation Everywhere</title>
    <link rel="alternate" type="text/html" href="http://justagwailo.com/filter/2006/08/16/lifebox-chapter-1" />
    <id>http://justagwailo.com/filter/2006/08/16/lifebox-chapter-1</id>
    <published>2006-08-16T00:49:27-07:00</published>
    <updated>2007-08-15T09:49:33-07:00</updated>
    <author>
      <name>Richard</name>
    </author>
    <category term="Filter" />
    <category term="Rudy Rucker" />
    <category term="computation" />
    <category term="lifebox" />
    <summary type="html"><![CDATA[<p>In the first chapter of <a href="http://www.amazon.com/exec/obidos/ASIN/1560257229/sillygwailo-20"><i>The Lifebox, the Seashell, and the Soul: What Gnarly Computation Taught Me About Ultimate Reality, the Meaning of Life, and How to Be Happy</i></a>, <a href="http://www.rudyrucker.com/">Rudy Rucker</a>, science fiction writer and computer scientist sets out his argument, which, handily, is the title of the chapter, "Computation Everywhere".  The chapter is part organizing—in which he lays out the structure of the rest of the book—and part introductory, defining computations as &ldquo;a process that obeys finitely describable rules&rdquo; and classifies them at least two ways, on feasibility and unpredictable lines, as well as how the computations go about.  Along the first, computaions can be:</p>
<ul>
<li>feasible and predictable</li>
<li>fessible and unpredictable</li>
<li>unfeasible and predictable</li>
<li>unfeasible and unpredictable</li>
</ul>
<p>and the second, they can be classified &ldquo;four main behaviors for arbitrary computations that are left running for a period of time&rdquo;:</p>
<ol>
<li>enter a constant state</li>
<li>generate a repetitive or nested pattern</li>
<li>produce messy, random-looking crud</li>
<li>produce gnarly, interacting, nonrepeating patterns</li>
</ol>
<p>He then goes on to define terms such as the Principle of Computational Equivalence, the Principle of Computational Unpredictability and universal computations, moving on to analytical machines.  The word "machine" in Turing Machine tricked my non-theoretical non-computer science into thinking it was necessarily a physical thing rather than a mathematical or algorithmic concept.  Emulation—and that any computer can, theoretically, emulate another—is a concept I have a fairly easy time grasping, if not so much later concepts such as cellular automaton (this time the word cellular tricking my brain into thinking about biological—i.e. existing in physical form—cells), and I'd probably have to see the cellular automaton rules play out in an animation, if maybe sped up.<br />
In subsequent chapters Rucker applies computations to biology and physics, the latter I did well enough in high school to be able to follow along and the former I have about zero knowledge of.  The book is so far well-written enough that I can plod through and jump back or pause to research more detailed explanations, though, so plod on I will.</p>
    ]]></summary>
    <content type="html"><![CDATA[<p>In the first chapter of <a href="http://www.amazon.com/exec/obidos/ASIN/1560257229/sillygwailo-20"><i>The Lifebox, the Seashell, and the Soul: What Gnarly Computation Taught Me About Ultimate Reality, the Meaning of Life, and How to Be Happy</i></a>, <a href="http://www.rudyrucker.com/">Rudy Rucker</a>, science fiction writer and computer scientist sets out his argument, which, handily, is the title of the chapter, "Computation Everywhere".  The chapter is part organizing—in which he lays out the structure of the rest of the book—and part introductory, defining computations as <span class="q">&ldquo;a process that obeys finitely describable rules&rdquo;</span> and classifies them at least two ways, on feasibility and unpredictable lines, as well as how the computations go about.  Along the first, computaions can be:</p>
<ul>
<li>feasible and predictable</li>
<li>fessible and unpredictable</li>
<li>unfeasible and predictable</li>
<li>unfeasible and unpredictable</li>
</ul>
<p>and the second, they can be classified <span class="q">&ldquo;four main behaviors for arbitrary computations that are left running for a period of time&rdquo;</span>:</p>
<ol>
<li>enter a constant state</li>
<li>generate a repetitive or nested pattern</li>
<li>produce messy, random-looking crud</li>
<li>produce gnarly, interacting, nonrepeating patterns</li>
</ol>
<p>He then goes on to define terms such as the Principle of Computational Equivalence, the Principle of Computational Unpredictability and universal computations, moving on to analytical machines.  The word "machine" in Turing Machine tricked my non-theoretical non-computer science into thinking it was necessarily a physical thing rather than a mathematical or algorithmic concept.  Emulation—and that any computer can, theoretically, emulate another—is a concept I have a fairly easy time grasping, if not so much later concepts such as cellular automaton (this time the word cellular tricking my brain into thinking about biological—i.e. existing in physical form—cells), and I'd probably have to see the cellular automaton rules play out in an animation, if maybe sped up.  </p>
<p>In subsequent chapters Rucker applies computations to biology and physics, the latter I did well enough in high school to be able to follow along and the former I have about zero knowledge of.  The book is so far well-written enough that I can plod through and jump back or pause to research more detailed explanations, though, so plod on I will.</p>
    ]]></content>
  </entry>
</feed>
