Computing with colored tangles

Avishy Y. Carmi; Daniel Moskovich

doi:10.3390/sym7031289

Computing with colored tangles

Avishy Y. Carmi, Daniel Moskovich

Department of Mechanical Engineering

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	1289-1332
Number of pages	44
Journal	Symmetry
Volume	7
Issue number	3
DOIs	https://doi.org/10.3390/sym7031289
State	Published - 1 Jan 2015

Keywords

Computation
Diagrammatic algebra
Interactive proof
Low dimensional topology
Turing machine

ASJC Scopus subject areas

Computer Science (miscellaneous)
Chemistry (miscellaneous)
General Mathematics
Physics and Astronomy (miscellaneous)

Access to Document

10.3390/sym7031289

Cite this

@article{5a73d9cd7ebe4d8e9c1f13d5abbcc311,

title = "Computing with colored tangles",

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.",

keywords = "Computation, Diagrammatic algebra, Interactive proof, Low dimensional topology, Turing machine",

author = "Carmi, {Avishy Y.} and Daniel Moskovich",

note = "Publisher Copyright: {\textcopyright} 2015 by the author.",

year = "2015",

month = jan,

day = "1",

doi = "10.3390/sym7031289",

language = "English",

volume = "7",

pages = "1289--1332",

journal = "Symmetry",

issn = "2073-8994",

publisher = "MDPI Multidisciplinary Digital Publishing Institute",

number = "3",

}

TY - JOUR

T1 - Computing with colored tangles

AU - Carmi, Avishy Y.

AU - Moskovich, Daniel

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

KW - Computation

KW - Diagrammatic algebra

KW - Interactive proof

KW - Low dimensional topology

KW - Turing machine

UR - http://www.scopus.com/inward/record.url?scp=84942274803&partnerID=8YFLogxK

U2 - 10.3390/sym7031289

DO - 10.3390/sym7031289

M3 - Article

AN - SCOPUS:84942274803

SN - 2073-8994

VL - 7

SP - 1289

EP - 1332

JO - Symmetry

JF - Symmetry

IS - 3

ER -

Computing with colored tangles

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this