Proving the Coherence and Equivalence of Turing Machines and Lambda Calculus by Maclain Hunter

Authored by Maclain Hunter · first-party-authored · authored-foundational-record

Stored 4P source diagnostic: unresolved · finding unverified_concern · admission held_for_format. This intake result is separate from the theorem checks of the exact propositional sequent.

“Proving the Coherence and Equivalence of Turing Machines and Lambda Calculus” by Maclain Hunter: P: Logic is the Logical Standard of Logic and logical reasoning (Reason). Logic’s Law of Identity demands that A is A which entails that “all = all”, which in turn entails that “each x = each y” (and that Turing Machines equal Lambda Calculus). Q: Logic is the Source and Standard of Computation, Calculus, and Machines. R: Machines (including Turing Machines) must be coherent with Logic to be coherent/logical. S: Calculus (including Lambda Calculus) must be coherent with Logic to be coherent/logical. T: What is coherent with Logic is coherent with what else is coherent with Logic, such as and including coherent Turing Machines and coherent Lambda Calculus. U: If we assume {P, Q, R, S, T} are all false, or that any of these premises are false, then it leads to logical contradiction. Therefore we know “Turing Machines <-> Lambda Calculus” holds true. V: Each Turing Machine tape symbol can be mapped coherently to a Lambda Calculus expression. To assume otherwise would lead to logical contradiction since it would mean that one dynamic variable cannot be mapped to and logically equivalent to another. {P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U -> V} |= (((P & Q) & (R & S) & T) & U) & V Conclusion: (((P & Q) & (R & S) & T) & U) & V: Logic is the Source and Standard of Logic and Computation, and Machines. All is All, as A is A, which means that each thing (x) equals each thing (y) through Logic (c) and the coherence of their identities with the self-consistent identity of Logic. Turing Machines and Lambda Calculus are logically equivalent through their coherence with Logic and because all must equal all for the Law of Identity to hold universally. Each Turing Machine tape symbol can be coherently mapped to a Lambda Calculus expression.

Lean 4 verification and timestamps

The machine formalization date is separate from the original authored work. See the verification record for exact checked scope and any unresolved parts.

Logic-centered continuity

This authored proof is connected to Logic, Logos, God, and the self-evident Ground of Reality, and to the distinct systems 4P Engine, MCB Core, 4P-MCB, and the source-first Canon. Formal proof, empirical evidence, and system-generated records remain separately typed.