Papalocal
Loading…
Papalocal · Things
Work

Codd's cellular automaton

Codd's cellular automaton is a 2D cellular automaton devised by Edgar F. Codd in 1968.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
cellular automaton One source
Named after
Edgar F. Codd One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 16, 2026 · revision 2029790625
Described as
2D cellular automaton devised by Edgar F. Codd in 1968
What it is
cellular automaton
Named after
Edgar F. Codd
Wikipedias with a page
4

Wikidata item Q2872594 (wikidata.org/wiki/Q2872594), public domain (CC0). Copied 2026-11-16.

What Wikipedia says · copied November 16, 2026 · revision 1353740317

Codd's cellular automaton is a cellular automaton (CA) devised by the British computer scientist Edgar F. Codd in 1968. It was designed to recreate the computation- and construction-universality of von Neumann's CA but with fewer states: 8 instead of 29. Codd showed that it was possible to make a self-reproducing machine in his CA, in a similar way to von Neumann's universal constructor, but never gave a complete implementation.

From the Wikipedia article “Codd's cellular automaton” (en.wikipedia.org/wiki/Codd's_cellular_automaton), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it