gpojani: Field notes on emergence, complexity & machines not from here

Skip to content

Field notes on emergence, complexity & machines not from here

SpecimenGianni Pojani

Rule 137 is Rule 110 with black and white swapped: an automaton defined by eight bits that can compute anything computable.

Class IV · Turing-complete →

transmissions ↓

Latest transmissions

№ 0032026.09.25

Rule 137: eight bits that compute everything

The emblem of this site is a mirror image of Rule 110, and Rule 110 is a universal computer.

№ 0022026.09.22

Gliders are messages

Five cells walk diagonally across the Game of Life. Build enough of them and you get a computer.

№ 0012026.09.20

Hello, colony

First transmission. What this notebook is for, and how to read it.

The instruments

LabAny of 262,144 Life-like rules. Draw, run, import RLE, share a link.AtlasAll 256 elementary automata on one wall, with their symmetry families.NetworkThe archive as a graph of transmissions and the ideas they share.

taxonomy

The complexity zoo

Posts here aren't sorted by tag. They're sorted by how hard they are to think through, using the nested classes of computational complexity theory. Start in P if you want something quick. RE is where the questions may never halt.

Enter the zoo →