rule-110-compiler · layered visualization
brainfuck
→
turing machine
→
cyclic tag system
→
rule 110
demo:
(pick…)
arithmetic + clear loop
copy cell 0 → cell 1
add 2 + 2
Hello World (cristofani-style)
cat (stdin: rule110!)
fibonacci (stdin: \x09 → F(11)=89)
cts identity
cts duplicator
r110 chaotic IC
r110 glider showcase
r110 C × Ē crossing
rule 110 inside bf inside rule 110
▶ play
◀ step
step ▶
⟲ reset
speed:
slow
normal
fast
turbo
t (global):
0 / 0
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.
+
−
>
<
[ ]
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
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
glider placements (uses ether background) OR raw bitstring (zero boundary). Worldline crossings ringed in
yellow
.
ether
defect / glider
A
B
C
D
Ē
collision