Computing with Coloured Tangles
Computational Complexity
2015-07-23 v3
Abstract
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured 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 that with bounded resources it can moreover decide any language in complexity class IP, sometimes with better performance parameters than corresponding classical protocols.
Cite
@article{arxiv.1408.2685,
title = {Computing with Coloured Tangles},
author = {Avishy Y. Carmi and Daniel Moskovich},
journal= {arXiv preprint arXiv:1408.2685},
year = {2015}
}
Comments
36 pages,; Introduction entirely rewritten, Section 4.3 added