Computability theory an introduction to recursion theory
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.
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Burlington, MA :
Elsevier Inc
[2011]
|
| Edición: | 1st edition |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009628082106719 |
Tabla de Contenidos:
- 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;
