Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Finding interesting patterns #1

Open
void4 opened this issue Jul 11, 2019 · 0 comments
Open

Finding interesting patterns #1

void4 opened this issue Jul 11, 2019 · 0 comments

Comments

@void4
Copy link

void4 commented Jul 11, 2019

In the paper Computation at the edge of chaos, Chris Langton was able to find interesting (turing complete) patterns by varying the distribution of state transition to a specific "root" state.

Inspired by that, I tried something similar once, with interesting results: https://imgur.com/gallery/sRUrI. Maybe you could try it as well - more variation, and competitive selection. Core Wars on steroids :)

It could also be interesting to find out what happens if the machines only have partial transition tables (and can cooperate/sabotage each other). Also: an energy cost.

There was an ios game called survivium a while ago, where players could program the things themselves: https://youtu.be/0WOJuZIlVfY?t=70

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant