Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

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

Dusko Pavlovic
  • Function : Author
  • PersonId : 1043055
Muzamil Yahia
  • Function : Author
  • PersonId : 1043056

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.
Fichier principal
Vignette du fichier
473364_1_En_10_Chapter.pdf (287.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02044646 , version 1 (21-02-2019)

Licence

Attribution

Identifiers

Cite

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⟩
45 View
139 Download

Altmetric

Share

Gmail Facebook X LinkedIn More