Small weakly universal Turing machines

Details Small weakly universal Turing machines Small weakly universal Turing machines

2007-07-30

arxiv.org/abs/0707.4489v1

Computer Science

Computational Complexity

Scientific paper

We give small universal Turing machines with state-symbol pairs of (6, 2),
(3, 3) and (2, 4). These machines are weakly universal, which means that they
have an infinitely repeated word to the left of their input and another to the
right. They simulate Rule 110 and are currently the smallest known weakly
universal Turing machines.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221821