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.

Sign up for GitHub

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

Jump to bottom

This is turing complete #63

Open

CrispyPin opened this issue May 6, 2024 · 1 comment

Contributor

CrispyPin commented May 6, 2024 •

edited

Loading

The README states

We lose Turing completeness because our new procedure is not deterministic, but practice shows that this formalism still allows to describe a huge range of interesting random processes.

But you can create a deterministic system with strict enough patterns.

Example of conways game of life in an async CA https://www.youtube.com/watch?v=oXiqMGhn9rk&t=749s

Rule 110 (which is turing complete) implemented in MarkovJunior:

rule_110.mp4

Owner

mxgmn commented May 6, 2024

That is an interesting question indeed! I'm a little swamped at the moment, but I'll answer as soon as I have time.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment