Re:Surprisingly Turing-Complete
by Jtsummers on Friday October 02, 2015 @09:05PM
(#10322178)
Rule 110 is Turing complete. Therefore anything which can implement/simulate it is also Turing complete.
The same is true of any other model of a Turing machine. If your host computer can simulate a Turing complete machine then the host is also Turing complete.
The same is true of any other model of a Turing machine. If your host computer can simulate a Turing complete machine then the host is also Turing complete.