Encodings of Turing machines in Linear Logic
arXiv:1805.10770 · doi:10.1017/S0960129520000109
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.
50 pages