User:Ssstephen/Reading/Universality in Elementary Cellular Automata: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

5 November 2022

  • curprev 13:4213:42, 5 November 2022‎ Ssstephen talk contribs‎ 1,977 bytes +1,977‎ Created page with "Because a system is universal, some of its properties are undecidable (will it become periodic, will a particular sequence occur) Because Turing machines are universal, if a compiler exists that can compile any data and program from a turing machine to another computer, then that computer is also universal Tag systems are universal ACDABBE --> DABBECCDD Cyclic tag systems can only have a two letter alphabet {Y,N}, but they can emulate tag systems so are also universal..."
Retrieved from "https://pzwiki.wdka.nl/mediadesign/User:Ssstephen/Reading/Universality_in_Elementary_Cellular_Automata"