Computing with colored tangles

Avishy Y. Carmi, Daniel Moskovich

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1289-1332
Number of pages44
JournalSymmetry
Volume7
Issue number3
DOIs
StatePublished - 1 Jan 2015

Keywords

  • Computation
  • Diagrammatic algebra
  • Interactive proof
  • Low dimensional topology
  • Turing machine

Fingerprint

Dive into the research topics of 'Computing with colored tangles'. Together they form a unique fingerprint.

Cite this