Encodings of Turing machines in linear logic
From MaRDI portal
Publication:5139286
DOI10.1017/S0960129520000109zbMath1495.03074arXiv1805.10770OpenAlexW2803157271MaRDI QIDQ5139286
Publication date: 8 December 2020
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.10770
Proof-theoretic aspects of linear logic and other substructural logics (03F52) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04) Categorical aspects of linear logic (18M45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing Khovanov-Rozansky homology and defect fusion
- On Sweedler's cofree cocommutative coalgebra.
- Linear logic
- Light linear logic
- Small universal Turing machines
- Glueing and orthogonality for models of linear logic
- Polynomial identity rings.
- The differential lambda-calculus
- An introduction to differential linear logic: proof-nets, models and antiderivatives
- Computational Complexity
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Theoretical Computer Science
This page was built for publication: Encodings of Turing machines in linear logic