arXiv Analytics

Sign in

arXiv:1805.10770 [math.LO]AbstractReferencesReviewsResources

Encodings of Turing machines in Linear Logic

James Clift, Daniel Murfet

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.

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
arXiv:1105.3335 [math.LO] (Published 2011-05-17, updated 2011-06-27)
Turing machines on represented sets, a model of computation for Analysis