Handbook of Computability Theory, Volume 140

1st Edition

Editors: E.R. Griffor
Hardcover ISBN: 9780444898821
eBook ISBN: 9780080533049
Imprint: North Holland
Published Date: 1st October 1999
Page Count: 724
200.00 + applicable tax
120.00 + applicable tax
149.00 + applicable tax
195.00 + applicable tax
Unavailable
Compatible Not compatible
VitalSource PC, Mac, iPhone & iPad Amazon Kindle eReader
ePub & PDF Apple & PC desktop. Mobile devices (Apple & Android) Amazon Kindle eReader
Mobi Amazon Kindle eReader Anything else

Institutional Access


Table of Contents

Part 1: Fundamentals of Computability Theory. 1. The history and concept of computability (R.I. Soare). 2. &pgr;01 classes in recursion theory (D. Cenzer). Part 2: Reducibilities and Degrees. 3. Reducibilities (P. Odifreddi). 4. Local degree theory (S.B. Cooper). 5. The global structure of the turing degrees (T.A. Slaman). 6. The recursively enumerable degrees (R.A. Shore). 7. An overview of the computably enumerable sets (R.I Soare). Part 3: Generalized Computability Theory. 8. The continuous functionals (D. Normann). 9. Ordinal recursion theory (C.T. Chong, S.D. Friedman). 10. E-recursion (G.E. Sacks). 11. Recursion on abstract structures (P.G. Hinman). Part 4: Mathematics and Computability Theory. 12. Computable rings and fields (V. Stoltenberg-Hansen, J.V. Tucker). 13. The structure of computability (M.B. Pour-El). 14. Theory of numberings (Y.L. Ershov). Part 5: Logic and Computability Theory. 15. Pure recursive model theory (T.S. Millar). 16. Classifying recursive functions (H. Schwichtenberg). Part 6: Computer Science and Computability Theory. 17. Computation models and function algebras (P. Clote). 18. Polynomial time reducibilities and degrees (K. Ambos-Spies).

Description

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.


Details

No. of pages:
724
Language:
English
Copyright:
© North Holland 1999
Published:
Imprint:
North Holland
eBook ISBN:
9780080533049
Hardcover ISBN:
9780444898821

Reviews

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.


About the Editors

E.R. Griffor Editor

Affiliations and Expertise

Communication Advisors, Inc., Southfield, MI, USA