Vor Ort
Merkzettel Warenkorb
  • Produktbild: Computability Theory
  • Produktbild: Computability Theory

Computability Theory

136,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

17.11.2003

Abbildungen

schwarz-weiss Illustrationen

Verlag

Taylor & Francis

Seitenzahl

420

Maße (L/B/H)

24/16,1/2,7 cm

Gewicht

716 g

Sprache

Englisch

ISBN

978-1-58488-237-4

Beschreibung

Rezension

"A very nice volume indeed. Although primarily a textbook, it lives up to the author's aim to have 'plenty here to interest and inform everyone, from the beginner to the expert.' ... Cooper writes in an informal style, emphasizing the ideas underlying the techniques. All the standard topics and classic results are here. ... Students will find useful pointers to the literature and an abundance of exercises woven into the text."
- Zentralblatt MATH, 1041
"[It] provides not only a reference repository of well-crafted proofs or proof-outlines for a large number of basic and beyond-basic facts in several areas of computability theory, but can also serve well as the textual basis for a course on the subject..."
- Mathematical Reviews, 2005h

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

17.11.2003

Abbildungen

schwarz-weiss Illustrationen

Verlag

Taylor & Francis

Seitenzahl

420

Maße (L/B/H)

24/16,1/2,7 cm

Gewicht

716 g

Sprache

Englisch

ISBN

978-1-58488-237-4

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
Die Leseprobe wird geladen.
  • Produktbild: Computability Theory
  • Produktbild: Computability Theory
  • SECTION I: COMPUTABILITY, AND UNSOLVABLE PROBLEMS HILBERT AND THE ORIGINS OF COMPUTABILITY THEORYAlgorithms and Algorithmic ContentHilbert's Programme Gödel, and the Discovery of IncomputabilityComputability and Unsolvability in the Real WorldMODELS OF COMPUTABILITY AND THE CHURCH-TURING THESISThe Recursive FunctionsChurch's Thesis, and the Computability of Sets and RelationsUnlimited Register MachinesTuring's MachinesChurch, Turing, and the Equivalence of ModelsLANGUAGE, PROOF AND COMPUTABLE FUNCTIONSPeano Arithmetic and its ModelsWhat Functions Can We Describe in a Theory?CODING, SELF-REFERENCE AND THE UNIVERSAL TURING MACHINERussell's ParadoxGödel NumberingsA Universal Turing MachineThe Fixed Point TheoremComputable ApproximationsENUMERABILITY AND COMPUTABILITYBasic NotionsThe Normal Form TheoremIncomputable Sets and the Unsolvability of the Halting Problem for Turing MachinesThe Busy Beaver functionTHE SEARCH FOR NATURAL EXAMPLES OF INCOMPUTABLE SETSThe Ubiquitous Creative Sets Some Less Natural Examples of Incomputable SetsHilbert's Tenth Problem and the Search for Really Natural ExamplesCOMPARING COMPUTABILITYMany-One ReducibilityThe Non-Computable Universe and Many-One Degrees Creative Sets RevisitedGÖDEL'S INCOMPLETENESS THEOREMSemi-Representability and C.E. SetsIncomputability and Gödel's TheoremDECIDABLE AND UNDECIDABLE THEORIESPA is Undecidable Other Undecidable Theories, and their Many-One EquivalenceSome Decidable TheoriesSECTION II: INCOMPUTABILITY AND INFORMATION CONTENTCOMPUTING WITH ORACLESOracle Turing MachinesRelativising, and Listing the Partial Computable FunctionalsIntroducing the Turing UniverseEnumerating with Oracles, and the Jump Operator The Arithmetical Hierarchy and Post's TheoremThe Structure of the Turing UniverseNONDETERMINISM, ENUMERATIONS AND POLYNOMIAL BOUNDSOracles versus Enumerations of Data Enumeration Reducibility and the Scott Model for Lambda Calculus The Enumeration Degrees,and the Natural Embedding of theTuring DegreesThe Structure of De and the Arithmetical HierarchyThe Medvedev LatticePolynomial Bounds and P =?NPSECTION III: MORE ADVANCED TOPICSPOST'S PROBLEM: IMMUNITY AND PRIORITYInformation Content and StructureImmunity PropertiesApproximation and PrioritySacks Splitting Theorem and Cone AvoidanceMinimal Pairs and Extensions of EmbeddingsThe |3 Theory - Information Content RegainedHigher Priority and Maximal SetsThe Computability of TheoriesFORCING AND CATEGORYForcing in Computability TheoryBaire Space, Category and Measuren-Genericity and Applications Forcing with Trees, and Minimal DegreesAPPLICATIONS OF DETERMINACYGale-Stewart Games An Upper Cone of Minimal Covers Borel and Projective Determinacy, and the Global Theory of DTHE COMPUTABILITY OF THEORIESFeferman's TheoremTruth versus ProvabilityComplete extensions of Peano Arithmetic and Classes The Low Basis TheoremArslanov's Completeness CriterionA Priority-Free Solution to Post's ProblemRandomnessCOMPUTABILITY AND STRUCTUREComputable ModelsComputability and Mathematical StructuresEffective Ramsey TheoryComputability in Analysis Computability and Incomputability in ScienceFURTHER READING INDEX