**Cellular Automata And Complexity: Collected Papers**

by Stephen Wolfram

**Publisher**: Westview Press 1994**ISBN/ASIN**: 0201626640**ISBN-13**: 9780201626643**Number of pages**: 608

**Description**:

These original and widely known papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for physics, biology, economics, computer science, and many other areas.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Rule-based Computation and Deduction**

by

**Helene Kirchner, Pierre-Etienne Moreau**-

**ESSLLI**

This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.

(

**4410**views)

**Bayesian Computational Methods**

by

**Christian P. Robert**-

**arXiv**

We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.

(

**4523**views)

**Introduction to Computing: Explorations in Language, Logic, and Machines**

by

**David Evans**-

**University of Virginia**

An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.

(

**9261**views)

**Introduction to Theory of Computation**

by

**Anil Maheshwari, Michiel Smid**-

**Carleton University**

This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.

(

**2972**views)