Loading...
Please wait, while we are loading the content...
Similar Documents
Undecidability and Reducibility
| Content Provider | Scilit |
|---|---|
| Author | Reiter, Edna E. Johnson, Clayton Matthew |
| Copyright Year | 2017 |
| Description | The basic idea of reducibility is simple: if one has two questions, and if one knows the answer to question 1 by the answer to question 2, you do not need both answers. Answering question 2 will answer both of them. In some sense, question 2 must be harder (or at least as hard) as question 1, since an answer to it answers both. Book Name: Encyclopedia of Computer Science and Technology |
| Related Links | https://content.taylorfrancis.com/books/download?dac=C2013-1-18440-3&isbn=9781315115894&doi=10.1201/9781315115894-79&format=pdf |
| Ending Page | 812 |
| Page Count | 10 |
| Starting Page | 803 |
| DOI | 10.1201/9781315115894-79 |
| Language | English |
| Publisher | Informa UK Limited |
| Publisher Date | 2017-10-02 |
| Access Restriction | Open |
| Subject Keyword | Book Name: Encyclopedia of Computer Science and Technology History and Philosophy of Science Undecidability Basic Idea Harder Two Questions Idea of Reducibility Reducibility Is Simple Reducibility The Basic |
| Content Type | Text |
| Resource Type | Chapter |