Encodings of Turing machines in Linear Logic
James Clift, Daniel Murfet
TL;DR
This paper explores various ways to encode Turing machine step functions within intuitionistic linear logic and analyzes their denotations using Sweedler semantics.
Contribution
It introduces multiple encodings of Turing machine steps in linear logic and computes their denotations in a semantic framework.
Findings
Multiple encodings successfully represent Turing machine steps.
Denotations in Sweedler semantics provide insights into the encodings.
Framework bridges computation models and linear logic semantics.
Abstract
We give several different encodings of the step function of a Turing machine in intuitionistic linear logic, and calculate the denotations of these encodings in the Sweedler semantics.
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.