Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
motohagiography
48 days ago
|
parent
|
context
|
favorite
| on:
Cryptids
these remind me of rule 110 in GoL
https://en.wikipedia.org/wiki/Rule_110
are they related?
Sharlin
48 days ago
|
next
[–]
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
47 days ago
|
prev
[–]
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:
are they related?