INTEGRATED STATESPACE COMPUTER

Schematic

− + X ^ + = − / ! / = −

Registers

S · state
0
C · position
101
A · lower
B · upper
τ · tape window
μ · fractal depth
τ = symbols evaluated per collapse window. μ = recursive collapse cycles before forced halt.

Execution

t/S S=0 · C=101
Position in state
tape[101] = —
set C F ≡ C,[A,B](t)

Tape

One address per line from 101. Tokens: 0–9 opcodes · E pull next E-COM line

Encoding

One codec per line. Everything becomes magnitudes of S; decode reverses it.

Collapse Physics

Enter a symbol string. Rules apply longest-match within τ, up to μ cycles.

Inverse Synthesis

from to depth
Breadth-first search over opcode paths, 9 → 1.

Genome

Persistence

Save/load uses local storage. Export downloads the full machine state as JSON.

Console

Trace

Manual

Opcodes — 0 BRK · 1 INC s+1 · 2 ADD s+s · 3 MUL s×s · 4 EQU hold · 5 EXP s^s · 6 NOT s≠0→1 else 0 · 7 DEC s−1 · 8 DIV ⌊s/2⌋ · 9 MOD s%2. After every op, C = F(S) clamps into [A,B].
OOA bridge — ◦→0 · |→1 · −→2 · +→4 · =→5 · !→6 · X→3 · ^→5 · /→8 · %→9 · _→0 · .→1. Forms Φ ∞ □ !_ become E-space constructors.
Collapse rules — _→. · .→.. · ..→− · −+−→= · .−→? · Φ−→| · ◦−?→Φ · Φ◦→∞ · !Φ□.→!_ · −?|?.−|→□.
Types — C: ≤3 symbols, terminal · I: cyclic · X: divergent past μ.
Encodings — int · text · bin · ooa · vec.