Computing with colored tangles (Q2406227): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3104243793 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1408.2685 / rank | |||
Normal rank | |||
Latest revision as of 05:32, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing with colored tangles |
scientific article |
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
