Handbook of Computability Theory

The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers.

Table des matières

Part 1: Fundamentals of Computability Theory. Part 2: Reducibilities and Degrees. Part 3: Generalized Computability Theory. Part 4: Mathematics and Computability Theory. Part 5: Logic and Computability Theory. Part 6: Computer Science and Computability Theory.

Résumé

Includes topics of computability theory that have been chosen based on the active research interest associated with them.

Détails du produit

• Auteurs: E. R. Griffor, E.R. Griffor, E.r. (Communication Advisors Griffor, Edward R. Griffor, GRIFFOR E R, E. R. Griffot
• Collaboration: E. R. Griffor (Editeur), E.r. (Communication Advisors Griffor (Editeur)
• Edition: ELSEVIER SCIENCE BV
• Langues: Anglais
• Format d'édition: Livre Relié
• Sortie: 01.10.1999
• EAN: 9780444898821
• ISBN: 978-0-444-89882-1
• Pages: 724
• Thème: Studies in Logic and the Foundations of Mathematics
• Catégorie: Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique