3 ms·
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 machin
by Jtsummers 11y ago
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.