Turing Automata and Graph Machines
Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the co...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1006.1428v1 |
id |
doaj-710e587b9965483d88e06f63362b9d75 |
---|---|
record_format |
Article |
spelling |
doaj-710e587b9965483d88e06f63362b9d752020-11-24T22:22:55ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-06-0126Proc. DCM 2010193110.4204/EPTCS.26.3Turing Automata and Graph MachinesMiklós BarthaIndexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example. http://arxiv.org/pdf/1006.1428v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Miklós Bartha |
spellingShingle |
Miklós Bartha Turing Automata and Graph Machines Electronic Proceedings in Theoretical Computer Science |
author_facet |
Miklós Bartha |
author_sort |
Miklós Bartha |
title |
Turing Automata and Graph Machines |
title_short |
Turing Automata and Graph Machines |
title_full |
Turing Automata and Graph Machines |
title_fullStr |
Turing Automata and Graph Machines |
title_full_unstemmed |
Turing Automata and Graph Machines |
title_sort |
turing automata and graph machines |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2010-06-01 |
description |
Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example. |
url |
http://arxiv.org/pdf/1006.1428v1 |
work_keys_str_mv |
AT miklosbartha turingautomataandgraphmachines |
_version_ |
1725766763954569216 |