Sabitlenmiş Tweet

Rule 110 Compiler: a working implementation of a Turing Complete single cell automata based on Michael Cook's proof. In this project, I successfully converted a Turing Machine representation of binary addition into a Tag System -> Cyclical Tag System -> Rule 110.
If you ever wanted to run the most inefficient and exponential (based on data size) compile-time program, this is for you. Full blog post here: forrestmeng.com/pages/blog/rul…
English









