- 724 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
Handbook of Computability Theory
About This Book
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.
Frequently asked questions
Information
Table of contents
- Cover image
- Title page
- Table of Contents
- Studies in Logic and the Foundations of Mathematics
- Copyright page
- Preface
- List of Contributors
- 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
- Author Index
- Subject Index