arXiv:1805.10770 [math.LO]AbstractReferencesReviewsResources
Encodings of Turing machines in Linear Logic
Published 2018-05-28Version 1
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.
Comments: 50 pages
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1805.11813 [math.LO] (Published 2018-05-30)
Derivatives of Turing machines in Linear Logic
arXiv:math/0209332 [math.LO] (Published 2002-09-25)
Hypercomputation: computing more than the Turing machine
Turing machines on represented sets, a model of computation for Analysis