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

Equivalent models of computation #830

Open

CapitalOM opened this issue Dec 11, 2023 · 0 comments

CapitalOM commented Dec 11, 2023

Chapter name: Equivalent models of computation (section: "Turing completeness and equivalence, a formal definition (optional)")

List of bugs/typos

In the section titled "Turing completeness and equivalence, a formal definition (optional)", there are two typos in the first definition (8.5) of Turing complete/equivalence. In the third paragraph, before "for every Turing machine", it should say "such that". In the fourth paragraph, "such that or every string" should be replaced with "such that for every string".

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