Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-d… - Stephen Wolfram

" "

Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterizations of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limit points, limit cycles and chaotic attractors. The fourth class is probably capable of universal computation, so that properties of its infinite time behaviour are undecidable.

English
Collect this quote

About Stephen Wolfram

Stephen Wolfram (born 29 August 1959) is a British scientist known for his work in theoretical particle physics, cellular automata, complexity theory, and computer algebra. He is the creator of the computer program Mathematica.

Go Premium

Support Quotewise while enjoying an ad-free experience and premium features.

View Plans

Related quotes. More quotes will automatically load as you scroll down, or you can use the load more buttons.

Additional quotes by Stephen Wolfram

It was the spring of 1978 and I was 18 years old. I’d been publishing papers on particle physics for a few years, and had gotten quite known around the international particle physics community (and, yes, it took decades to live down my teenage-particle-physicist persona). I was in England, but planned to soon go to graduate school in the US, and was choosing between Caltech and Princeton. And one weekend afternoon when I was about to go out, the phone rang. In those days, it was obvious if it was an international call. “This is Murray Gell-Mann”, the caller said, then launched into a monologue about why Caltech was the center of the universe for particle physics at the time.

Go Premium

Support Quotewise while enjoying an ad-free experience and premium features.

View Plans
[S]cience has become used to... using the little... pockets of computational reducibility ([A]n inevitable consequence of computational irreducibility... There have to be these pockets ...scattered around.) to be able to find those cases where you can jump ahead.

Loading...