Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract)
From MaRDI portal
Publication:1798794
DOI10.1007/978-3-030-00389-0_10OpenAlexW2890386422MaRDI QIDQ1798794
Publication date: 23 October 2018
Full work available at URL: https://arxiv.org/abs/1704.04882
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monoidal computer. I: Basic computability by string diagrams
- Combinatorial realizability models of type theory
- Bialgebras for structural operational semantics: an introduction
- Comparing models of the intensional typed \(\lambda\)-calculus
- Notions of computation and monads
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Introduction to Turing categories
- Realizability. An introduction to its categorical side
- Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus
- Classical recursion theory. The theory of functions and sets of natural numbers
- Universal coalgebra: A theory of systems
- Models of computation
- Geometry of abstraction in quantum computation
- Kleene's Amazing Second Recursion Theorem
- Timed Sets, Functional Complexity, and Computability
- The intensional content of Rice's theorem
- Quantum and Classical Structures in Nondeterminstic Computation
- Testing Semantics: Connecting Processes and Process Logics
- Dominical categories: recursion theory without elements
- Categorical logic of names and abstraction in action calculi
- The chemical basis of morphogenesis
- The monoidal structure of Turing machines
- Monads need not be endofunctors
- Quantum complexity theory
- Smooth coalgebra: testing vector analysis
- Chasing Diagrams in Cryptography
- Coalgebraic Logic and Synthesis of Mealy Machines
- A Machine-Independent Theory of the Complexity of Recursive Functions
- An Unsolvable Problem of Elementary Number Theory
This page was built for publication: Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract)