Download presentation

Presentation is loading. Please wait.

Published byWeston Rich Modified over 4 years ago

1
Rice ’ s Theorem

2
Def: A property of the Turing-recognizable languages is simply a subset of all Turing- recognizable languages.

3
A property is trivial if it is either empty or is all Turing-recognizable languages. Otherwise, it is nontrivial. Note that the empty property is different from the property { }.

4
Thm: Every nontrivial property of the Turing- recognizable languages is undecidable.

5
Pf: Let C be a nontrivial property. Assume , otherwise we can consider. Since C is nontrivial, there exists a non- empty language L C.

6
Letbe a TM accepting (or recognizing) L. Given, construct the following TM : M w Accept Start x

7
Thus, if we could decide or not,then we could decide. Therefore, C is undecidable.

8
Eg. The following are undecidable: 1. 2. 3. 4.

9
Eg. How about the following: 1. 2.

Similar presentations

© 2020 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google