Turing Automata and Graph Machines

Details Turing Automata and Graph Machines Turing Automata and Graph Machines

2010-06-08

arxiv.org/abs/1006.1428v1

EPTCS 26, 2010, pp. 19-31

Computer Science

Formal Languages and Automata Theory

Scientific paper

10.4204/EPTCS.26.3

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.

Affiliated with

Also associated with

No associations

Rating

Turing Automata and Graph Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Turing Automata and Graph Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing Automata and Graph Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29463