Recursion Theory: Lecture Notes in Logic 1
Autor Joseph R. Shoenfielden Limba Engleză Paperback – 20 feb 2001
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 428.13 lei 6-8 săpt. | |
CRC Press – 20 feb 2001 | 428.13 lei 6-8 săpt. | |
Hardback (2) | 755.48 lei 6-8 săpt. | |
Cambridge University Press – mar 2017 | 755.48 lei 6-8 săpt. | |
CRC Press – 9 aug 2017 | 1039.31 lei 6-8 săpt. |
Preț: 428.13 lei
Nou
Puncte Express: 642
Preț estimativ în valută:
81.95€ • 85.93$ • 67.71£
81.95€ • 85.93$ • 67.71£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781568811499
ISBN-10: 1568811497
Pagini: 96
Dimensiuni: 156 x 234 x 6 mm
Greutate: 0.16 kg
Ediția:UK edition
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
ISBN-10: 1568811497
Pagini: 96
Dimensiuni: 156 x 234 x 6 mm
Greutate: 0.16 kg
Ediția:UK edition
Editura: CRC Press
Colecția A K Peters/CRC Press
Locul publicării:United States
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.