The monoidal structure of Turing machines

DOI10.1017/S0960129512000096MaRDI QIDQ4917187zbMATH OpenFDO

Authors Miklós Bartha

Publication date 29 April 2013

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129512000096

Mathematics Subject Classification ID

Categories of machines, automata (18B20) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Recommendations

• Turing automata and graph machines
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Monoidal computer. I: Basic computability by string diagrams
• Quantum Turing automata
• Reversible monadic computing

Cites work

• A categorical framework for finite state machines
• A structural approach to reversible computation
• Advanced Linear Algebra
• An algebraic model of synchronous systems
• An equational axiomatization of systolic systems
• Automata Studies. (AM-34)
• Axiomatizing schemes and their behaviors
• Coherence for bicategories and indexed categories
• Coherence for compact closed categories
• Coherence theorems via knot theory
• Context-free graph grammars and concatenation of graphs
• Feedback, trace and fixed-point semantics
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 3751225 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Irreversibility and Heat Generation in the Computing Process
• Linear logic
• Logical Reversibility of Computation
• Matching theory
• Quantum weakest preconditions
• Soliton automata
• Soliton automata with constant external edges
• Structuring the elementary components of graphs having a perfect internal matching.
• The geometry of tensor calculus. I
• The Space and Motion of Communicating Agents
• Traced monoidal categories

Cited in

(4)

• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Query-monotonic Turing reductions
• Monoidal computer. I: Basic computability by string diagrams
• Turing automata and graph machines

This page was built for publication: The monoidal structure of Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917187)