Computing with colored tangles (Q2406227)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6781001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing with colored tangles |
scientific article; zbMATH DE number 6781001 |
Statements
Computing with colored tangles (English)
0 references
27 September 2017
0 references
Summary: We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated colored tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams represent bisimilar computations. We prove that our model of computation is Turing complete and with bounded resources that it can decide any language in complexity class IP, sometimes with better performance parameters than corresponding classical protocols.
0 references
diagrammatic algebra
0 references
low-dimensional topology
0 references
Turing machine
0 references
interactive proof
0 references
0.7214226126670837
0 references
0.7164400815963745
0 references
