Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

these remind me of rule 110 in GoL https://en.wikipedia.org/wiki/Rule_110

are they related?



Weeell, sure, in the obvious sense that 110 is Turing complete. So you can encode any of these cryptids as a 110 initial pattern.


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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: