A Category Theoretic Interpretation of Gandy's Principles for Mechanisms
Discrete Mathematics
2019-04-24 v1 Logic in Computer Science
Abstract
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a category should have. The computation is modelled by a functor that encodes updating the computation, and we give an abstract account of such functors. We show that every updating functor satisfying our conditions is computable.
Keywords
Cite
@article{arxiv.1904.10109,
title = {A Category Theoretic Interpretation of Gandy's Principles for Mechanisms},
author = {Joseph Razavi and Andrea Schalk},
journal= {arXiv preprint arXiv:1904.10109},
year = {2019}
}
Comments
In Proceedings DCM 2018 and ITRS 2018 , arXiv:1904.09561