Recursion Theory: Lecture Notes in Logic 1
Autor Joseph R. Shoenfielden Limba Engleză Hardback – 9 aug 2017
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 439.62 lei 6-8 săpt. | |
| CRC Press – 20 feb 2001 | 439.62 lei 6-8 săpt. | |
| Hardback (2) | 782.71 lei 6-8 săpt. | |
| Cambridge University Press – mar 2017 | 782.71 lei 6-8 săpt. | |
| CRC Press – 9 aug 2017 | 1073.29 lei 6-8 săpt. |
Preț: 1073.29 lei
Preț vechi: 1601.39 lei
-33% Nou
Puncte Express: 1610
Preț estimativ în valută:
189.91€ • 223.01$ • 166.70£
189.91€ • 223.01$ • 166.70£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781138466876
ISBN-10: 1138466875
Pagini: 96
Dimensiuni: 156 x 234 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
ISBN-10: 1138466875
Pagini: 96
Dimensiuni: 156 x 234 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția A K Peters/CRC Press
Cuprins
Computability; Functions and Relations; The Basic Machine; Macros; Closure Properties; Definitions of Recursive Functions; Codes; Indices; Church's Thesis; Word Problems; Undecidable Theories; Relative Recursion; The Arithmetical Hierarchy; Recursively Enumerable Relations; Degrees; Evaluation of Degrees; Large RE Sets; Functions of Reals; The Analytical Hierarchy; The Projective Hierarchy
Descriere
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an 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. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.