2-State 3-Symbol Universal Turing Machines Do Not Exist

Details 2-State 3-Symbol Universal Turing Machines Do Not Exist 2-State 3-Symbol Universal Turing Machines Do Not Exist

2007-06-29

arxiv.org/abs/0706.4440v5

Computer Science

Other Computer Science

1 page

Scientific paper

In this brief note, we give a simple information-theoretic proof that 2-state
3-symbol universal Turing machines cannot possibly exist, unless one loosens
the definition of "universal".

Affiliated with

Also associated with

No associations

Rating

2-State 3-Symbol Universal Turing Machines Do Not Exist 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 2-State 3-Symbol Universal Turing Machines Do Not Exist, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 2-State 3-Symbol Universal Turing Machines Do Not Exist will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682100