Monoidal computer. I: Basic computability by string diagrams

DOI10.1016/j.ic.2013.03.007zbMath1317.68054arXiv1208.5205OpenAlexW2112234929MaRDI QIDQ385721

Dusko Pavlovic

Publication date: 3 December 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5205

Mathematics Subject Classification ID

Related Items

Interacting Hopf algebras ⋮ Symmetric Monoidal Categories with Attributes ⋮ Promonads and String Diagrams for Effectful Categories ⋮ Smooth coalgebra: testing vector analysis ⋮ Contextual equivalence for signal flow graphs ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Chasing Diagrams in Cryptography ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Uses Software

• EasyCrypt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Why John von Neumann did not like the Hilbert space formalism of quantum mechanics (and what he liked instead)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Monoidal categories with natural numbers object
• Cartesian bicategories. I
• Coherence for compact closed categories
• The geometry of tensor calculus. I
• Toy Quantum Categories (Extended Abstract)
• Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories
• H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics
• Geometry of abstraction in quantum computation
• Kleene's Amazing Second Recursion Theorem
• Interacting Quantum Observables
• Classical and quantum structuralism
• Quantum and Classical Structures in Nondeterminstic Computation
• Coalgebras and cartesian categories
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Foundations of Cryptography
• Categorical logic of names and abstraction in action calculi
• Frobenius monads and pseudomonoids
• A new description of orthogonal bases
• Computer-Aided Security Proofs for the Working Cryptographer
• Quantum complexity theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS