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.
@article{arxiv.1805.10770,
title = {Encodings of Turing machines in Linear Logic},
author = {James Clift and Daniel Murfet},
journal= {arXiv preprint arXiv:1805.10770},
year = {2020}
}