Small Turing universal signal machines

Details Small Turing universal signal machines Small Turing universal signal machines

2009-06-17

arxiv.org/abs/0906.3225v1

EPTCS 1, 2009, pp. 70-80

Computer Science

Computational Complexity

Scientific paper

10.4204/EPTCS.1.7

This article aims at providing signal machines as small as possible able to
perform any computation (in the classical understanding). After presenting
signal machines, it is shown how to get universal ones from Turing machines,
cellular-automata and cyclic tag systems. Finally a halting universal signal
machine with 13 meta-signals and 21 collision rules is presented.

Affiliated with

Also associated with

No associations

Rating

Small Turing universal signal 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 Small Turing universal signal machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Small Turing universal signal machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223570