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

Prove ΙΧΘΥΣ is Turing Complete #3

hornc opened this Issue Oct 6, 2018 · 0 comments


None yet
1 participant

hornc commented Oct 6, 2018 should be sufficient. Needs some tidy up and checking.

Cyclic tag systems are Turing complete, implementing one in a language is a way to prove it is computationally equivalent.

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