10.5 Equivalence of Models
Detailed equivalence proofs between Turing machines, recursive functions, and lambda calculus, with explicit constructions and simulations.
4 notes
Detailed equivalence proofs between Turing machines, recursive functions, and lambda calculus, with explicit constructions and simulations.
How isomorphism formalizes structural sameness and separates equality from equivalence.
Different notions of sameness in mathematics: strict equality, structural identity, and equivalence relations.
Logical equivalence, truth preserving transformations, and basic laws for rewriting propositional formulas.