1 / 29

Computer Science 500 Theory of Computation Spring, 2000 March 1 1. Rice s Theorem 2. Kleene hierarchy 2. Homework 5 -

6 Theorems. Assume that L1 mapping reduces to L2. If L2 is decidable and then L1 is decidable If L1 is undecidable and then L1 is undecidable If L2 is recognizable and then L1 is recognizable If L1 is unrecognizable and then L2 is unrecognizable If L2 is co-recognizable and then L1 is co-recognizable If L1 is not co-recognizable and then L2 is not co-recognizable.

chandler
Download Presentation

Computer Science 500 Theory of Computation Spring, 2000 March 1 1. Rice s Theorem 2. Kleene hierarchy 2. Homework 5 -

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    More Related