By dotCore
via blog.barvinograd.com
Submitted: Nov 25 2012 / 19:57
It is 114 characters long and can probably reduced further using some clever python tricks. It implements one of the most extraordinarily simple Turing-Complete models: a Cyclic Tag System or CTS. The CTS was first introduced by Mathew Cook in 2004 when he published his paper on the universality of Elementary Cellular Automata and specifically Rule 110.
Tweet
SaveShareSend
Tags: how-to, methodology, other languages, tools
Add your comment