rule-110-compiler · layered visualization

brainfuck source

op 0 / 0

standard 8-bit BF (byte cells, 256-wrap), 256-cell tape. , reads stdin; EOF → 0. . appends to stdout shown below.

+ − > < [ ] , input . output pc

turing machine trace

step 0 / 0 · state —

compiled from bf source via compile_bf (mirrors compiler/bf_to_tm.py). tape rows scroll, head boxed.

0 nonzero (brighter = larger) head head=input (,) head=output (.)

cyclic tag system

step 0 / 0 · cursor a0

format: lines appendants: a0, a1, … and tape: YYN…. Use _ for empty appendant.

Y N current row

rule 110 spacetime

step 0 / 0 · collisions 0

cts: re-encodes the CTS tape at each CTS step via encode_cts_state and shows a scrolling window of bands around the current step — each band is an independent re-encode (state correspondence per step), not a causal continuation. Otherwise glider placements OR raw bitstring. Crossings ringed in yellow.

ether defect / glider slot=Y slot=N A B C D Ē collision