Skip to Main content Skip to Navigation
Conference papers

Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract)

Abstract : Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a high-level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or taking them into account when they are genuinely needed. A salient feature of the approach through monoidal categories is the formal graphical language of string diagrams, which supports geometric reasoning about programs and computations. In the present paper, we provide a coalgebraic characterization of monoidal computer. It turns out that the availability of interpreters and specializers, that make a monoidal category into a monoidal computer, is equivalent with the existence of a universal state space, that carries a weakly final state machine for all types of input and output. Being able to program state machines in monoidal computers allows us to represent Turing machines, and capture the time and space needed for their executions. The coalgebraic view of monoidal computer thus provides a convenient diagrammatic language for studying not only computability, but also complexity.
Document type :
Conference papers
Complete list of metadata

Cited literature [48 references]  Display  Hide  Download

https://hal.inria.fr/hal-02044646
Contributor : Hal Ifip <>
Submitted on : Thursday, February 21, 2019 - 3:41:15 PM
Last modification on : Saturday, June 12, 2021 - 11:46:01 AM
Long-term archiving on: : Wednesday, May 22, 2019 - 9:43:41 PM

File

473364_1_En_10_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Dusko Pavlovic, Muzamil Yahia. Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract). 14th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2018, Thessaloniki, Greece. pp.167-189, ⟨10.1007/978-3-030-00389-0_10⟩. ⟨hal-02044646⟩

Share

Metrics

Record views

71

Files downloads

24