HackerPapers

arXiv:1805.11813math.LO

Derivatives of Turing machines in Linear Logic

James Clift, Daniel Murfet

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We calculate denotations under the Sweedler semantics of the Ehrhard-Regnier derivatives of various encodings of Turing machines into linear logic. We show that these derivatives calculate the rate of change of probabilities naturally arising in the Sweedler semantics of linear logic proofs. The resulting theory is applied to the problem of synthesising Turing machines by gradient descent.

arXiv comments
62 pages, moved the section on naive Bayesian observers earlier (Section 6.2) with slight changes to notation, references added in the introduction to Section 7 and related work in Remark 7.16
Journal reference
DOI
Subjects
math.LOLogic

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from May 2018 to May 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.