top | item 46257655 (no title) motohagiography | 2 months ago these remind me of rule 110 in GoL https://en.wikipedia.org/wiki/Rule_110are they related? discuss order hn newest Sharlin|2 months ago Weeell, sure, in the obvious sense that 110 is Turing complete. So you can encode any of these cryptids as a 110 initial pattern. dloranc|2 months ago You can encode any Turing machine as initial state for rule 110, but as far as I know it isn't useful for studying Busy Beavers.
Sharlin|2 months ago Weeell, sure, in the obvious sense that 110 is Turing complete. So you can encode any of these cryptids as a 110 initial pattern.
dloranc|2 months ago You can encode any Turing machine as initial state for rule 110, but as far as I know it isn't useful for studying Busy Beavers.
Sharlin|2 months ago
dloranc|2 months ago