Cellular Automata - 1st Edition - ISBN: 9781483200149, 9781483225173

Cellular Automata

1st Edition

Authors: E. F. Codd
Editors: Robert L. Ashenhurst
eBook ISBN: 9781483225173
Imprint: Academic Press
Published Date: 1st January 1968
Page Count: 132
Sales tax will be calculated at check-out Price includes VAT/GST
Price includes VAT/GST
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.


Cellular Automata presents the fundamental principles of homogeneous cellular systems. This book discusses the possibility of biochemical computers with self-reproducing capability.

Organized into eight chapters, this book begins with an overview of some theorems dealing with conditions under which universal computation and construction can be exhibited in cellular spaces. This text then presents a design for a machine embedded in a cellular space or a machine that can compute all computable functions and construct a replica of itself in any accessible and sufficiently large region of the space. Other chapters consider simulation of one cellular space by another. This book discusses as well the goal of exhibiting universal computer-constructor. The final chapter deals with the use of a digital computer for research in cellular automata.

This book is a valuable resource for computer designers and programmers who want a better understanding of the principles of homogeneous cellular systems. Automata theoreticians and biochemists will also find this book useful.

Table of Contents


Chapter 1. Introduction

1.1 Nature of Investigation

1.2 Outline

Chapter 2. Basic Definitions

2.1 Introductory Remark

2.2 Cellular Space

2.3 Configurations

2.4 Computation

2.5 Construction

2.6 Self-Reproduction

2.7 Symmetries of Cellular Spaces

Chapter 3. Propagation and Universality

3.1 Preliminary Definitions

3.2 Propagation in Certain 2-State Cellular Spaces

3.3 Universality

Chapter 4. A Universal 8-State, 5-Neighbor Cellular Space

4.1 Introductory Remark

4.2 Principal Objectives

4.3 Subordinate Objectives

4.4 The Eight States

4.5 The Definition of the Transition Function f

4.6 Paths and Signals

4.7 The Sheathed Path

4.8 The Three Phases of Construction

4.9 Propagation of Signals

4.10 Propagation Down Sheathed Paths

4.11 Corners and Junctions

4.12 Collision of Signals

4.13 Sheathing an Unsheathed Path

4.14 The Cap on a Path End

4.15 Gates and Gating

4.16 Path Extension and Signal Sequences

4.17 The Marking Signals

4.18 Changing the State of Cells p and q

4.19 Path Extension Left and Right

4.20 Path Retraction

4.21 Path Retraction Left and Right

4.22 Operations upon (0,1) Configurations

4.23 Marking and Erasing

4.24 Sensing

4.25 Signal Injection

4.26 Summary of Signal Sequences and Operations

4.27 Transition Function Tables

Chapter 5. Components

5.1 Introductory Remark

5.2 Notation and Convention

5.3 Permanent One-Way Lock


No. of pages:
© Academic Press 1968
Academic Press
eBook ISBN:

About the Author

E. F. Codd

About the Editor

Robert L. Ashenhurst

Ratings and Reviews