4 ms·
One example that doesn’t require any CS to appreciate is Rule 110[1], arguably the simplest Turing complete system. It clearly shows this pattern graphically. W
by bjornsing 5y ago
One example that doesn’t require any CS to appreciate is Rule 110[1], arguably the simplest Turing complete system. It clearly shows this pattern graphically. Wikipedia describes it this way:
“Rule 110, like the Game of Life, exhibits what Wolfram calls "Class 4 behavior", which is neither completely stable nor completely chaotic. Localized structures appear and interact in complex ways.”
1. https://en.m.wikipedia.org/wiki/Rule_110 https://en.m.wikipedia.org/wiki/Rule_110