Is universality decidable?

122 Views Asked by At

Is there a turing machine which can take any other TM T as input and decide whether T is a universal turing machine?

1

There are 1 best solutions below

1
On BEST ANSWER

No such Turing machine could exist. See Rice's theorem: http://en.wikipedia.org/wiki/Rice%27s_theorem.