Encoding Turing Machines into the Deterministic Lambda-Calculus
Ugo Dal Lago, Beniamino Accattoli
TL;DR
This paper explores how to encode Turing machines within the deterministic lambda-calculus, aiming to understand computational representations in lambda calculus.
Contribution
It introduces a method for encoding Turing machines into the deterministic lambda-calculus, providing a formal framework for such encodings.
Findings
Successful encoding of Turing machines in lambda calculus
Formal proof of encoding correctness
Potential applications in computational theory
Abstract
This note is about encoding Turing machines into the lambda-calculus.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.