Computability theory : an introduction to recursion theory /
Herbert B. Enderton.
Bok Engelsk 2011 · Electronic books.
| Utgitt | Amsterdam ; Oxford : : Academic, , 2011.
|
|---|---|
| Omfang | 1 online resource (192 p.)
|
| Opplysninger | Bibliographic Level Mode of Issuance: Monograph. - 1. The Computability Concept; 2. General Recursive Functions; 3. Programs and Machines; 4. Recursive Enumerability; 5. Connections to Logic; 6. Degrees of Unsolvability; 7. Polynomial-Time Computability; Appendix: Mathspeak; Appendix: Countability; Appendix: Decadic Notation;. - This textbook is designed to introduce undergraduate mathematics and computer science students to computability theory (recursion theory). It is based on teaching experience, and is designed to be accessible to junior and senior students without a previous background in the subject.. - Electronic reproduction.
|
| Emner | |
| Sjanger | |
| Dewey | |
| ISBN | 9780123849588
|
