A New Kind of Science, Though It Once, and in Doing So I Have Mostly Ended 29 Computation

Total Page:16

File Type:pdf, Size:1020Kb

A New Kind of Science, Though It Once, and in Doing So I Have Mostly Ended 29 Computation S CIENCE’ S C OMPASS BOOKS ET AL. 65 nomena as well as fundamental philosophi- 64 BOOKS: DOING SCIENCE cal questions. Each of these ideas warrants 63 careful consideration. 62 61 Is the Universe a Universal Computer? Complexity from Simple Programs 60 Melanie Mitchell Throughout the book, Wolfram presents 59 many beautiful, striking pictures of the be- 58 istory has seen the development of troller and limited communication among havior of various cellular automata. These 57 many new sciences but very few components. Originally defined and stud- demonstrate that even elementary cellular 56 Hnew kinds of science. New kinds of ied by the mathematicians Stanislaw Ulam automata can produce patterns ranging 55 science involve radical changes in think- and John von Neumann, cellular automata from simple to quite complicated, highly 54 ing, such as the shift from Aristotelian tra- have been used as models for such natural ordered to seemingly random. The great 53 ditions to experi- phenomena as earthquakes, turbulent flow, diversity of these patterns and the fact that mental methods biological pigmentation, and tumor growth. such simple rules can produce such appar- A New Kind and the description They have also been applied in computer ently complex behavior is viewed by Wol- of Science of natural phenom- science as idealizations of massively paral- fram as deeply significant. by Stephen Wolfram ena in mathemati- lel, non-centralized computation. That simple rules can produce complex Wolfram Media, Cham- cal terms—revolu- Wolfram grounds his approach on six behavior is a very important idea, and it un- paign, IL, 2002. 1280 pp. tions associated principal claims: Simple programs (i.e., ele- derlies the science of complex systems. $44.95, £40, C$69.95. with names like mentary cellular automata) can produce However, Wolfram implies that the notion ISBN 1-57955-008-8. Galileo and New- highly complex and random-looking behav- was his discovery and the field of complex ton. Thus it is with systems his invention—an 52 no small risk of hubris that Stephen Wol- absurd claim. The idea of 51 fram titles his account of his approach to simple rules leading to 50 explaining the natural world A New Kind complex behavior under- 49 of Science. At over 1200 pages, his book lies much of dynamical 48 rivals the combined lengths of Galileo’s systems theory and par- 47 Dialogues and Newton’s Principia. But ticularly the subset often 46 does it fulfill the promise of its title and known as “chaos theory.” 45 heft? Not very well. I don’t know when the 44 The book’s central idea is that the sim- idea was first articulated, 43 ple computer programs, namely cellular Image not but by the early 1970s 42 automata, can explain natural phenomena available for Nicholas Metropolis, Paul 41 that have so far eluded “traditional” mathe- online use. Stein, and Myron Stein 40 matical approaches such as differential (1) had provided a de- 39 equations. A cellular automaton, in its sim- tailed explanation of the 38 plest incarnation, is a one-dimensional line complex behavior of sim- 37 of sites or cells, each of which is either ple iterated maps (such as 36 black or white. The color (state) of the cell the famous “logistic 35 can change over time. At each discrete time map”). In the late 1960s, 34 step, every cell updates its state—either re- John Conway developed 33 taining or flipping its color from the previ- his “Game of Life,” a 32 ous step—as a function of its previous state simple two-dimensional 31 and those of its two nearest neighbors. The cellular automaton capa- 30 cellular automaton rule comprises the list ble of highly complex be- 29 of functions that map each three-cell Width doublers. These examples of three-color cellular automata havior (2). Around the 28 neighborhood to the update state for the that achieve the purpose of doubling the width of their initial con- same time, Aristid Lin- 27 center cell. In his theoretical work, Wol- dition were taken from the 4277 cases found in an exhaustive denmayer invented what 26 fram typically considers the lines of cells search of all of the more than 7.625 x 1012 possible rules. are now called L-systems, 25 limitless to ensure there is no ambiguity at simple rules that give rise 24 the boundaries. Such one-dimensional, ior. Such programs, implemented in natural to extremely lifelike pictures of plants and 23 two-state, two-neighbor cellular automata systems, give rise to most of the complexity other natural forms (3). One of Wolfram’s 22 are called elementary; more complicated and randomness that we observe in nature. own early contributions was observing and 21 versions can have additional states per cell, These programs lead to better models of classifying such complex behavior in ele- 20 larger neighborhoods to determine update complex systems than do traditional mathe- mentary cellular automata. 19 states, and additional dimensions. matical approaches. Computation in cellu- 18 Cellular automata are perhaps the most lar automata and similar simple programs Origins of Complexity in Nature 17 idealized models of complex systems: they provide a new framework for understanding In Wolfram’s view, cellular automata or simi- 16 consist of large numbers of simple compo- complex systems. Elementary cellular au- lar simple rules are responsible for most of 15 nents (here, cells) with no central con- tomata can exhibit the ability to perform the randomness and complexity seen in na- 14 any computable procedure. This computa- ture. To support this claim, he notes that ran- 13 tional universality gives rise to the principle domness and complexity are very common 12 The author is at the Department of Computer Sci- ence and Engineering, OGI School of Science and En- of “computational equivalence,” which in the behavior of simple rules and that some 11 gineering, Oregon Health and Sciences University, Wolfram claims is a new law of nature that complex and random-looking phenomena in 10 CREDIT: STEPHEN WOLFRAM Beaverton, OR 97006, USA. E-mail: [email protected] illuminates many aspects of natural phe- nature have visual features similar to those www.sciencemag.org SCIENCE VOL 298 4 OCTOBER 2002 65 S CIENCE’ S C OMPASS 65 produced by simple cellular automata. He therefore, natural selection is not needed to to capture the essence of what is going on— 64 offers an important and useful discussion of create complexity in biology. In his view, even though traditional efforts have been 63 the terms “random” and “complex.” The biological systems are complex merely be- quite unsuccessful.” But as far as I can tell, 62 meaning of both terms depends on the fea- cause evolution has sampled a huge num- his approach has yielded no new successful 61 tures of behavior that are of interest and the ber of simple programs and these often predictions, and none of his interesting 60 available perceptual and analytical tools. give rise to complex behavior. Wolfram of- speculations on physics propose any experi- 59 Wolfram examines these connections in fers no convincing evidence for this claim, ments to support this view. 58 considerable detail, and he devotes an entire nor does he discuss where these programs 57 chapter to a discussion of perception and are implemented—at the level of the Computational Universality 56 analysis. Nonetheless, there is little support genome? of cells? Although cellular au- A centerpiece of the book is Wolfram’s 55 for his claim that because simple rules tomata provide plausible models of biologi- sketch of a proof done by Caltech graduate 54 commonly produce random and complex- cal pigmentation and some aspects of mor- student (and former Wolfram research as- 53 looking behavior, simple rules must be the phology, there is as yet no compelling link sistant) Matthew Cook that one of the ele- 52 source of most such behavior in nature. between simple programs and complex bi- mentary cellular automaton rules can sup- 51 In addition, Wolfram distances his results ological systems such as the brain, the im- port universal computation. In describing 50 on cellular automata from earlier results on mune system, or cellular metabolism. On this result, Wolfram gives an excellent re- 49 chaotic systems. He contends that whereas view of some central ideas 48 some cellular automata can generate ran- Pigmentation patterns in theoretical computer sci- 47 domness “intrinsically” (starting from a on mollusc shells. ence. The notion of univer- 46 very simple initial condition), a chaotic sys- Wolfram interprets sal computation was first 45 tem can do so only when its initial condition their striking resem- developed by Alan Turing 44 is random. This is incorrect; there are many blance to the patterns in the 1930s. Roughly, a 43 chaotic systems in which even a very simple Image not produced by simple device is said to be “uni- 42 initial condition produces a random-looking one-dimensional cellu- versal” or “can support 41 output—the Lorenz system of equations (4) available for lar automata as evi- universal computation” if it 40 is one well-known example. In general, cel- online use. dence that they are can run any program on 39 lular automata are a type of discrete dynam- generated by processes any input. Nowadays, ap- whose basic rules are 38 ical system and can exhibit behavior analo- proximations to a universal chosen at random from 37 gous to chaos. Thus, many of the results a set of the simplest devices are commonplace; 36 from the theory of dynamical systems apply possibilities. they are known as pro- 35 to cellular automata. grammable computers.
Recommended publications
  • Jet Development in Leading Log QCD.Pdf
    17 CALT-68-740 DoE RESEARCH AND DEVELOPMENT REPORT Jet Development in Leading Log QCD * by STEPHEN WOLFRAM California Institute of Technology, Pasadena. California 91125 ABSTRACT A simple picture of jet development in QCD is described. Various appli- cations are treated, including transverse spreading of jets, hadroproduced y* pT distributions, lepton energy spectra from heavy quark decays, soft parton multiplicities and hadron cluster formation. *Work supported in part by the U.S. Department of Energy under Contract No. DE-AC-03-79ER0068 and by a Feynman Fellowship. 18 According to QCD, high-energy e+- e annihilation into hadrons is initiated by the production from the decaying virtual photon of a quark and an antiquark, ,- +- each with invariant masses up to the c.m. energy vs in the original e e collision. The q and q then travel outwards radiating gluons which serve to spread their energy and color into a jet of finite angle. After a time ~ 1/IS, the rate of gluon emissions presumably decreases roughly inversely with time, except for the logarithmic rise associated with the effective coupling con­ 2 stant, (a (t) ~ l/log(t/A ), where It is the invariant mass of the radiating s . quark). Finally, when emissions have degraded the energies of the partons produced until their invariant masses fall below some critical ~ (probably c a few times h), the system of quarks and gluons begins to condense into the observed hadrons. The probability for a gluon to be emitted at times of 0(--)1 is small IS and may be est~mated from the leading terms of a perturbation series in a (s).
    [Show full text]
  • Impartial Games Emulating One-Dimensional Cellular Automata and Undecidability
    Impartial games emulating one-dimensional cellular automata and undecidability Urban Larsson Department of Mathematical Sciences Chalmers University of Technology and G¨oteborg University April 18, 2021 Abstract We study two-player take-away games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram's rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right patterns, the rule 110 cellular automaton was recently proved Turing-complete by Matthew Cook. Hence, many questions regarding its behavior are algorithmically undecidable. We show that similar questions are undecidable for our rule 110 game. 1 Introduction We study the inter-connections between two popular areas of mathematics, two-player combinatorial games e.g. [BCG04] and cellular automata (CAs) [N66, HU79, W84a, W84b, W84c, W86, W02]. We present an infinite class of games and prove that their outcomes (or winning strategies) emulate corre- arXiv:1201.1039v1 [math.CO] 5 Jan 2012 sponding one-dimensional CAs. In particular we study some recent results of Matthew Cook, [C04, C08], concerning algorithmic undecidability of Stephen Wolfram's well known elementary cellular automaton, rule 110, and interpret these results in the setting of our games. The universality of the rule 110 automaton was conjectured by S. Wolfram in 1985. It is also discussed in the remarkable book, [W02]. Our games are played between two players and are purely combinatorial| there is no element of chance and no hidden information. They are similar 1 to the take away games found in [G66, S70, Z96]. In such games the players take turns in removing tokens (coins, matches, stones) from a finite number of heaps, each with a given finite number of tokens.
    [Show full text]
  • A New Kind of Science; Stephen Wolfram, Wolfram Media, Inc., 2002
    A New Kind of Science; Stephen Wolfram, Wolfram Media, Inc., 2002. Almost twenty years ago, I heard Stephen Wolfram speak at a Gordon Confer- ence about cellular automata (CA) and how they can be used to model seashell patterns. He had recently made a splash with a number of important papers applying CA to a variety of physical and biological systems. His early work on CA focused on a classification of the behavior of simple one-dimensional sys- tems and he published some interesting papers suggesting that CA fall into four different classes. This was original work but from a mathematical point of view, hardly rigorous. What he was essentially claiming was that even if one adds more layers of complexity to the simple rules, one does not gain anything be- yond these four simples types of behavior (which I will describe below). After a two decade hiatus from science (during which he founded Wolfram Science, the makers of Mathematica), Wolfram has self-published his magnum opus A New Kind of Science which continues along those lines of thinking. The book itself is beautiful to look at with almost a thousand pictures, 850 pages of text and over 300 pages of detailed notes. Indeed, one might suggest that the main text is for the general public while the notes (which exceed the text in total words) are aimed at a more technical audience. The book has an associated web site complete with a glowing blurb from the publisher, quotes from the media and an interview with himself to answer questions about the book.
    [Show full text]
  • PARTON and HADRON PRODUCTION in E+E- ANNIHILATION Stephen Wolfram California Institute of Technology, Pasadena, California 91125
    549 * PARTON AND HADRON PRODUCTION IN e+e- ANNIHILATION Stephen Wolfram California Institute of Technology, Pasadena, California 91125 Ab stract: The production of showers of partons in e+e- annihilation final states is described according to QCD , and the formation of hadrons is dis­ cussed. Resume : On y decrit la production d'averses d� partons dans la theorie QCD qui forment l'etat final de !'annihilation e+ e , ainsi que leur transform­ ation en hadrons. *Work supported in part by the U.S. Department of Energy under contract no. DE-AC-03-79ER0068. SSt1 Introduction In these notes , I discuss some attemp ts e ri the cl!evellope1!1t of - to d s c be hadron final states in e e annihilation events ll>Sing. QCD. few featm11res A (barely visible at available+ energies} of this deve l"'P"1'ent amenab lle· are lt<J a precise and formal analysis in QCD by means of pe·rturbatirnc• the<J ry. lfor the mos t part, however, existing are quite inadle<!i""' lte! theoretical mett:l�ods one must therefore simply try to identify dl-iimam;t physical p.l:ten<0melilla tt:he to be expected from QCD, and make estll!att:es of dne:i.r effects , vi.th the hop·e that results so obtained will provide a good appro�::illliatimn to eventllLal'c ex­ act calculations . In so far as such estllma�es r necessa�y� pre�ise �r..uan- a e titative tests of QCD are precluded . On the ott:her handl , if QC!Ji is ass11l!med correct, then existing experimental data to inve•stigate its be­ may \JJ:SE•«f havior in regions not yet explored by theoreticalbe llJleaums .
    [Show full text]
  • The Problem of Distributed Consensus: a Survey Stephen Wolfram*
    The Problem of Distributed Consensus: A Survey Stephen Wolfram* A survey is given of approaches to the problem of distributed consensus, focusing particularly on methods based on cellular automata and related systems. A variety of new results are given, as well as a history of the field and an extensive bibliography. Distributed consensus is of current relevance in a new generation of blockchain-related systems. In preparation for a conference entitled “Distributed Consensus with Cellular Automata and Related Systems” that we’re organizing with NKN (= “New Kind of Network”) I decided to explore the problem of distributed consensus using methods from A New Kind of Science (yes, NKN “rhymes” with NKS) as well as from the Wolfram Physics Project. A Simple Example Consider a collection of “nodes”, each one of two possible colors. We want to determine the majority or “consensus” color of the nodes, i.e. which color is the more common among the nodes. A version of this document with immediately executable code is available at writings.stephenwolfram.com/2021/05/the-problem-of-distributed-consensus Originally published May 17, 2021 *Email: [email protected] 2 | Stephen Wolfram One obvious method to find this “majority” color is just sequentially to visit each node, and tally up all the colors. But it’s potentially much more efficient if we can use a distributed algorithm, where we’re running computations in parallel across the various nodes. One possible algorithm works as follows. First connect each node to some number of neighbors. For now, we’ll just pick the neighbors according to the spatial layout of the nodes: The algorithm works in a sequence of steps, at each step updating the color of each node to be whatever the “majority color” of its neighbors is.
    [Show full text]
  • Purchase a Nicer, Printable PDF of This Issue. Or Nicest of All, Subscribe To
    Mel says, “This is swell! But it’s not ideal—it’s a free, grainy PDF.” Attain your ideals! Purchase a nicer, printable PDF of this issue. Or nicest of all, subscribe to the paper version of the Annals of Improbable Research (six issues per year, delivered to your doorstep!). To purchase pretty PDFs, or to subscribe to splendid paper, go to http://www.improbable.com/magazine/ ANNALS OF Special Issue THE 2009 IG® NOBEL PRIZES Panda poo spinoff, Tequila-based diamonds, 11> Chernobyl-inspired bra/mask… NOVEMBER|DECEMBER 2009 (volume 15, number 6) $6.50 US|$9.50 CAN 027447088921 The journal of record for inflated research and personalities Annals of © 2009 Annals of Improbable Research Improbable Research ISSN 1079-5146 print / 1935-6862 online AIR, P.O. Box 380853, Cambridge, MA 02238, USA “Improbable Research” and “Ig” and the tumbled thinker logo are all reg. U.S. Pat. & Tm. Off. 617-491-4437 FAX: 617-661-0927 www.improbable.com [email protected] EDITORIAL: [email protected] The journal of record for inflated research and personalities Co-founders Commutative Editor VP, Human Resources Circulation (Counter-clockwise) Marc Abrahams Stanley Eigen Robin Abrahams James Mahoney Alexander Kohn Northeastern U. Research Researchers Webmaster Editor Associative Editor Kristine Danowski, Julia Lunetta Marc Abrahams Mark Dionne Martin Gardiner, Tom Gill, [email protected] Mary Kroner, Wendy Mattson, General Factotum (web) [email protected] Dissociative Editor Katherine Meusey, Srinivasan Jesse Eppers Rose Fox Rajagopalan, Tom Roberts, Admin Tom Ulrich Technical Eminence Grise Lisa Birk Psychology Editor Dave Feldman Robin Abrahams Design and Art European Bureau Geri Sullivan Art Director emerita Kees Moeliker, Bureau Chief Contributing Editors PROmote Communications Peaco Todd Rotterdam Otto Didact, Stephen Drew, Ernest Lois Malone Webmaster emerita [email protected] Ersatz, Emil Filterbag, Karen Rich & Famous Graphics Steve Farrar, Edinburgh Desk Chief Hopkin, Alice Kaswell, Nick Kim, Amy Gorin Erwin J.O.
    [Show full text]
  • Cellular Automata and Agent-Based Models
    Cellular automata and agent-based models Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2016 M. Macauley (Clemson) Cellular automata and agent-based models Math 4500, Spring 2016 1 / 18 Cellular automata A cellular automaton (CA) consists of a regular grid of cells, each one being ON (1) or OFF (0). At each time-step, every state is updated based on the states of its neighbors. As a simple example, consider an infinite 1D grid of cells, each one having the following update rule, called \Rule 30": The following shows the evolution of the dynamics over t 0; 1;:::; 8, starting with a single \ON" cell: M. Macauley (Clemson) Cellular automata and agent-based models Math 4500, Spring 2016 2 / 18 Cellular automata When you zoom out to see 200 time-steps, patterns start to emerge. A common theme with CA are that complex dynamics can emerge from simple, local interactions. M. Macauley (Clemson) Cellular automata and agent-based models Math 4500, Spring 2016 3 / 18 Cellular automata and self-organizing systems Complexity is observed all throughout the natural world, expecially in biology. Question: Can complex bevavior emerge naturally from a few simple rules? YES! For example, here is Rule 30 with a different initial condition: Many believe that CAs are key to understanding how simple rules can produce complex structures and behavior. M. Macauley (Clemson) Cellular automata and agent-based models Math 4500, Spring 2016 4 / 18 Some history Cellular automata (CA) were invented by Stanislaw Ulam and John von Neumann in the 1940s at Los Alamos National Laboratory, based on work by Alan Turing.
    [Show full text]
  • A New Kind of Science: a 15-Year View
    A New Kind of Science: A 15-Year View Stephen Wolfram Founder and CEO Wolfram Research, Inc. [email protected] Starting now, in celebration of its 15th anniversary, A New Kind of Science will be freely available in its entirety, with high-resolution images, on the web or for download. It’s now 15 years since I published my book A New Kind of Science — more than 25 since I started writing it, and more than 35 since I started working towards it. But with every passing year I feel I under- stand more about what the book is really about—and why it’s impor- tant. I wrote the book, as its title suggests, to contribute to the progress of science. But as the years have gone by, I’ve realized that the core of what’s in the book actually goes far beyond science—into many areas that will be increasingly important in defining our whole future. So, viewed from a distance of 15 years, what is the book really about? At its core, it’s about something profoundly abstract: the the- ory of all possible theories, or the universe of all possible universes. But for me one of the achievements of the book is the realization that one can explore such fundamental things concretely—by doing actual experiments in the computational universe of possible programs. And https://doi.org/10.25088/ComplexSystems.26.3.197 198 S. Wolfram in the end the book is full of what might at first seem like quite alien pictures made just by running very simple such programs.
    [Show full text]
  • Cellular Automation
    John von Neumann Cellular automation A cellular automaton is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays.[2] A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood is defined relative to the specified cell. An initial state (time t = 0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the stochastic cellular automaton and asynchronous cellular automaton. The concept was originally discovered in the 1940s by Stanislaw Ulam and John von Neumann while they were contemporaries at Los Alamos National Laboratory. While studied by some throughout the 1950s and 1960s, it was not until the 1970s and Conway's Game of Life, a two-dimensional cellular automaton, that interest in the subject expanded beyond academia.
    [Show full text]
  • A New Kind of Science
    Wolfram|Alpha, A New Kind of Science A New Kind of Science Wolfram|Alpha, A New Kind of Science by Bruce Walters April 18, 2011 Research Paper for Spring 2012 INFSY 556 Data Warehousing Professor Rhoda Joseph, Ph.D. Penn State University at Harrisburg Wolfram|Alpha, A New Kind of Science Page 2 of 8 Abstract The core mission of Wolfram|Alpha is “to take expert-level knowledge, and create a system that can apply it automatically whenever and wherever it’s needed” says Stephen Wolfram, the technologies inventor (Wolfram, 2009-02). This paper examines Wolfram|Alpha in its present form. Introduction As the internet became available to the world mass population, British computer scientist Tim Berners-Lee provided “hypertext” as a means for its general consumption, and coined the phrase World Wide Web. The World Wide Web is often referred to simply as the Web, and Web 1.0 transformed how we communicate. Now, with Web 2.0 firmly entrenched in our being and going with us wherever we go, can 3.0 be far behind? Web 3.0, the semantic web, is a web that endeavors to understand meaning rather than syntactically precise commands (Andersen, 2010). Enter Wolfram|Alpha. Wolfram Alpha, officially launched in May 2009, is a rapidly evolving "computational search engine,” but rather than searching pre‐existing documents, it actually computes the answer, every time (Andersen, 2010). Wolfram|Alpha relies on a knowledgebase of data in order to perform these computations, which despite efforts to date, is still only a fraction of world’s knowledge. Scientist, author, and inventor Stephen Wolfram refers to the world’s knowledge this way: “It’s a sad but true fact that most data that’s generated or collected, even with considerable effort, never gets any kind of serious analysis” (Wolfram, 2009-02).
    [Show full text]
  • Downloadable PDF of the 77500-Word Manuscript
    From left: W. Daniel Hillis, Neil Gershenfeld, Frank Wilczek, David Chalmers, Robert Axelrod, Tom Griffiths, Caroline Jones, Peter Galison, Alison Gopnik, John Brockman, George Dyson, Freeman Dyson, Seth Lloyd, Rod Brooks, Stephen Wolfram, Ian McEwan. In absentia: Andy Clark, George Church, Daniel Kahneman, Alex "Sandy" Pentland (Click to expand photo) INTRODUCTION by Venki Ramakrishnan The field of machine learning and AI is changing at such a rapid pace that we cannot foresee what new technical breakthroughs lie ahead, where the technology will lead us or the ways in which it will completely transform society. So it is appropriate to take a regular look at the landscape to see where we are, what lies ahead, where we should be going and, just as importantly, what we should be avoiding as a society. We want to bring a mix of people with deep expertise in the technology as well as broad 1 thinkers from a variety of disciplines to make regular critical assessments of the state and future of AI. —Venki Ramakrishnan, President of the Royal Society and Nobel Laureate in Chemistry, 2009, is Group Leader & Former Deputy Director, MRC Laboratory of Molecular Biology; Author, Gene Machine: The Race to Decipher the Secrets of the Ribosome. [ED. NOTE: In recent months, Edge has published the fifteen individual talks and discussions from its two-and-a-half-day Possible Minds Conference held in Morris, CT, an update from the field following on from the publication of the group-authored book Possible Minds: Twenty-Five Ways of Looking at AI. As a special event for the long Thanksgiving weekend, we are pleased to publish the complete conference—10 hours plus of audio and video, as well as this downloadable PDF of the 77,500-word manuscript.
    [Show full text]
  • Universality in Elementary Cellular Automata
    Universality in Elementary Cellular Automata Matthew Cook Department of Computation and Neural Systems,! Caltech, Mail Stop 136-93, Pasadena, California 91125, USA The purpose of this paper is to prove a conjecture made by Stephen Wolfram in 1985, that an elementary one dimensional cellular automaton known as “Rule 110” is capable of universal computation. I developed this proof of his conjecture while assisting Stephen Wolfram on research for A New Kind of Science [1]. 1. Overview The purpose of this paper is to prove that one of the simplest one di- mensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular se- quence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolfram’s numbering scheme [2]. Being a one dimensional cellular automaton, it consists of an infinitely long row of cells "Ci # i $ !%. Each cell is in one of the two states "0, 1%, and at each discrete time step every cell synchronously updates ' itself according to the value of itself and its nearest neighbors: &i, Ci ( F(Ci)1, Ci, Ci*1), where F is the following function: F(0, 0, 0) ( 0 F(0, 0, 1) ( 1 F(0, 1, 0) ( 1 F(0, 1, 1) ( 1 F(1, 0, 0) ( 0 F(1, 0, 1) ( 1 F(1, 1, 0) ( 1 F(1, 1, 1) ( 0 This F encodes the idea that a cell in state 0 should change to state 1 exactly when the cell to its right is in state 1, and that a cell in state 1 should change to state 0 just when the cells on both sides are in state 1.
    [Show full text]