Universal Turing Machine Problems
Posted
by Pindatjuh
on Stack Overflow
See other posts from Stack Overflow
or by Pindatjuh
Published on 2010-01-20T12:10:05Z
Indexed on
2010/04/03
4:03 UTC
Read the original article
Hit count: 418
turing-machines
|universal
If I have a machine, call it machine 1, that is able to solve a problem: it's just a machine, not persé a Turing machine. It can solve one specific problem. If this exact same problem can be solved on a Universal Turing Machine, then is my original machine, 1, a Universal Turing Machine too?
This does not hold for all problems, which is already ansered. Are there any problems which have this described property at all? If it is absolutely not true, then why?
Can someone give an example of a problem to be solved. If this problem is solved by my original machine, 1, definately makes this a Universal Turning Machine? Or does such a problem not exists? If it doesn't exists, why?
I'm very interested, but can't figure it out... Thanks.
Edit: made the question more clear.
© Stack Overflow or respective owner