Tangle Machines
Abstract
Tangle machines are topologically inspired diagrammatic models. Their novel feature is their natural notion of equivalence. Equivalent tangle machines may differ locally, but globally they are considered to share the same information content. The goal of tangle machine equivalence is to provide a context-independent method to select, from among many ways to perform a task, the `best' way to perform the task. The concept of equivalent tangle machines is illustrated through examples in which they represent recursive computations, networks of adiabatic quantum computations, and networks of distributed information processing.
Cite
@article{arxiv.1404.2862,
title = {Tangle Machines},
author = {Avishy Y. Carmi and Daniel Moskovich},
journal= {arXiv preprint arXiv:1404.2862},
year = {2015}
}
Comments
29 pages, 37 figures. Major revision. Introduction rewritten. Definitions simplified, with the Gauss diagram definition pushed to an appendix. Previous appendix removed