Equivalent models of computation

[CapitalOM]

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

List of bugs/typos

1. 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".