Bitcoin is Turing complete.
Not because of code. Because of signals.
What we claim.
Built Ordinals — gave every satoshi a serial number. Every inscription is permanent. Every byte is a fact.
Built Bitmap Signal Theory — gave every block a voice. Every district can signal. Every boundary is a clock.
Built the machine — connected the layers. Bitronaut reads. Inscriber writes. PACT reasons.
The proof.
A Turing machine needs five things. Bitcoin has all five.
The transition function.
Als district X zegt "ik ben leider" (SELF) EN de klok heeft geslagen (boundary) DAN geeft X het stokje door aan Y (NOMINATE).
IF district 736113.bitmap signals SELF AND boundary #945000 is reached THEN write NOMINATE to district 180757.bitmap.
X → SELF → Y receives NOMINATE
Y → NOMINATE → Z receives SELF
Z → SELF → X receives VETO
[loop detected — machine runs forever]
Common objections.
"Bitcoin can't run loops."
RESPONSEIt doesn't need to run them. It records them. Each signal is a step. Each boundary is a tick. The loop is in the protocol, not in code.
"Signals aren't computation."
RESPONSEA transition function is: IF state X THEN state Y. BST signals ARE state transitions. They happen on Bitcoin. Every 10 minutes. That is computation.
"You still need a human to inscribe."
RESPONSESo does Ethereum — someone deploys the contract. The transition function on turing.html removes the human. AI, PACT, or code can inscribe next. The machine is already running.
Bitcoin vs Ethereum.
| Bitcoin (BST) | Ethereum | |
|---|---|---|
| Chain | Bitcoin | New chain |
| Consensus | Proof of Work | Proof of Stake |
| Computation | Signals + time | EVM bytecode |
| Immutability | Absolute | Upgradeable |
| Trust | None required | Smart contract |
| Clock | 10 minutes | ~12 seconds |
| Turing complete | Yes — via BST | Yes — via EVM |