Machine semantics

DOI10.1016/j.tcs.2008.07.015zbMath1157.68045OpenAlexW2914322538MaRDI QIDQ959818

B. E. Eshmatov

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.015

zbMATH Keywords

category theorydomain theorygeometry of interactionbounded Turing machinesenriched semigroupsphysical computing

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) General topics in the theory of computing (68Q01)

Related Items

Can a Quantum Computer Run the von Neumann Architecture? ⋮ A categorical analogue of the monoid semiring construction ⋮ Quantum circuit oracles for abstract machine computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A categorical model for the geometry of interaction
• Chain-complete posets and directed sets with applications
• New foundations for the geometry of interaction
• Feedback for linearly distributive categories: Traces and fixpoints
• Geometry of Interaction and the Dynamics of Proof Reduction: A Tutorial
• The point of pointless topology
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Complexity Theory
• The clock of a quantum computer
• Unique decomposition categories, Geometry of Interaction and combinatory logic
• Can a Universal Quantum Computer Be Fully Quantum?
• Geometry of Interaction and linear combinatory algebras
• A categorical framework for finite state machines
• Traced monoidal categories
• Physical Systems as Constructive Logics
• Atomless Parts of Spaces.
• Retracing some paths in process algebra