Cantitate/Preț
Produs

Recursion Theory: Lecture Notes in Logic, cartea 1

Autor Joseph R. Shoenfield
en Limba Engleză Hardback – mar 2017
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 43962 lei  6-8 săpt.
  CRC Press – 20 feb 2001 43962 lei  6-8 săpt.
Hardback (2) 78271 lei  6-8 săpt.
  Cambridge University Press – mar 2017 78271 lei  6-8 săpt.
  CRC Press – 9 aug 2017 107329 lei  6-8 săpt.

Din seria Lecture Notes in Logic

Preț: 78271 lei

Preț vechi: 91012 lei
-14% Nou

Puncte Express: 1174

Preț estimativ în valută:
13852 16245$ 12146£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781107168084
ISBN-10: 1107168082
Pagini: 92
Dimensiuni: 156 x 235 x 11 mm
Greutate: 0.31 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Lecture Notes in Logic

Locul publicării:New York, United States

Cuprins

1. Computability; 2. Functions and relations; 3. The basic machine; 4. Macros; 5. Closure properties; 6. Definitions of recursive functions; 7. Codes; 8. Indices; 9. Church's thesis; 10. Word problems; 11. Undecidable theories; 12. Relative recursion; 13. The arithmetical hierarchy; 14. recursively enumerable relations; 15. Degrees; 16. Evaluation of degrees; 17. Large RE sets; 18. Functions of reals; 19. The analytical hierarchy; 20. The projective hierarchy; Suggestions for further reading; Index.

Notă biografică


Descriere

A clear and focused introduction to recursion theory that is ideal for teaching and self-study.