Reserved IP Address°C
04-24-2025
BSV
$30.24
Vol 28.37m
-1.6%
BTC
$92725
Vol 34819.27m
-0.99%
BCH
$347.57
Vol 278.52m
-3.29%
LTC
$81.53
Vol 375.28m
-3.4%
DOGE
$0.17
Vol 1676.72m
-4.11%
Getting your Trinity Audio player ready...

This post originally appeared on Medium, and we republished with permission from Xiaohui Liu.

We have implemented Rule 110 on Bitcoin. Similar to two-dimensional cellular automata (CA) Conway’s Game of Life, Rule 110, a one-dimensional CA, is also Turing-complete. By deduction, we have shown Bitcoin is Turing Complete, once again.

Rule 110

250 iterations of rule 110
250 iterations of rule 110

The Rule 110 cellular automaton is a 1-dimensional elementary CA, where a linear pattern of 0s and 1s evolves according to a simple set of rules. Whether a point in the pattern will be 0 or 1 in the new generation depends on its current value and on those of its two neighbors. The Rule 110 has the following set of rules:

Rule 110
Rule 110

The name “Rule 110” is based on the fact that this rule can be summarized in the binary sequence 01101110, corresponding to the decimal value 110.

An animation of Rule 110
An animation of Rule 110

Turing-Complete

Despite its simplicity, Rule 110 is Turing-complete, as proven in Universality in Elementary Cellular Automata (Cook 2004). This implies that, in principle, it can simulate any calculation or computer program. Rule 110 is arguably the simplest known Turing-complete system.

Implementation

We have implemented Rule 110, in a similar approach to implementing Game of Life.

Rule 110
Rule 110

Recommended for you

India launches first full-stack quantum computing system
During World Quantum Day, India unveiled its first full-stack quantum computing system, positioning itself at the forefront of tech revolution.
April 23, 2025
OpenAI launches ‘better and cheaper’ GPT-4.1
OpenAI's new model handles 6X more tokens and is 26% cheaper than its predecessor, as the cost wars DeepSeek sparked...
April 22, 2025
Advertisement
Advertisement
Advertisement