Atjaunināt sīkdatņu piekrišanu

Recursion Theory [Hardback]

(Duke University, North Carolina)
  • Formāts: Hardback, 92 pages, height x width x depth: 235x156x11 mm, weight: 290 g
  • Sērija : Lecture Notes in Logic
  • Izdošanas datums: 02-Mar-2017
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 1107168082
  • ISBN-13: 9781107168084
  • Hardback
  • Cena: 150,95 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 92 pages, height x width x depth: 235x156x11 mm, weight: 290 g
  • Sērija : Lecture Notes in Logic
  • Izdošanas datums: 02-Mar-2017
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 1107168082
  • ISBN-13: 9781107168084
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.

Papildus informācija

A clear and focused introduction to recursion theory that is ideal for teaching and self-study.
1 Computability
1(1)
2 Functions and Relations
2(1)
3 The Basic Machine
3(2)
4 Macros
5(3)
5 Closure Properties
8(3)
6 Definitions of Recursive Functions
11(5)
7 Codes
16(4)
8 Indices
20(6)
9 Church's Thesis
26(2)
10 Word Problems
28(4)
11 Undecidable Theories
32(7)
12 Relative Recursion
39(4)
13 The Arithmetical Hierarchy
43(5)
14 Recursively Enumerable Relations
48(5)
15 Degrees
53(6)
16 Evaluation of Degrees
59(4)
17 Large RE Sets
63(4)
18 Functions of Reals
67(4)
19 The Analytical Hierarchy
71(3)
20 The Projective Hierarchy
74(5)
Suggestions for Further Reading 79(2)
Index 81
Joseph R. Shoenfield works in the Department of Mathematics at Duke University, North Carolina.