Tangle machines
From MaRDI portal
Abstract: Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they are considered to share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the `best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which they represent recursive computations, networks of adiabatic quantum computations, and networks of distributed information processing.
Recommendations
Cites work
- A \(G\)-family of quandles and handlebody-knots
- A classifying invariant of knots, the knot quandle
- Categorical quantum mechanics
- Computing with colored tangles
- Distributivity versus associativity in the homology theory of algebraic structures
- Finite-type invariants of w-knotted objects. I: \(w\)-knots and the Alexander polynomial
- Fixing the functoriality of Khovanov homology
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3321941 (Why is no real title available?)
- Knot Logic
- Modular operads
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Planar algebras. I
- Tangle machines
- Virtual knot theory
Cited in
(9)- 2-tangles
- Computing with colored tangles
- Tinkertoys for the twisted D-series
- Distributed information fusion in tangle networks
- Tangle machines
- Inca foams
- scientific article; zbMATH DE number 6140066 (Why is no real title available?)
- Tangle machines
- scientific article; zbMATH DE number 5066283 (Why is no real title available?)
This page was built for publication: Tangle machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945575)