Handbook of Computability Theory
- ISBN-10
- 0080533043
- ISBN-13
- 9780080533049
- Category
- Mathematics
- Pages
- 724
- Language
- English
- Published
- 1999-10-01
- Publisher
- Elsevier
- Author
- E.R. Griffor
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.
Get the book
Similar books
-
Handbook of Computability and Complexity in Analysis
By Vasco Brattka, Peter HertlingThis handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field.
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques
By Mikhail J. Atallah, Marina BlantonAlgorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques.
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques
By Mikhail J. Atallah, Marina BlantonFor example, Rosser and Schoenfeld [RS62] proved that n lnn ( 1 + 1 2 lnn ) < π(n) < n lnn ( 1 + 3 2 lnn ) for all n ≥ 59. Rosser [Ros39] proved in 1939 that the nth prime is ... Let li(x) = x0 dylny denote the logarithmic integral.
-
Computable Analysis: An Introduction
By Klaus WeihrauchMerging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for studying various aspects of computability and complexity in analysis.
-
Computability Theory
By S. Barry CooperComputability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s.
-
Turing Computability: Theory and Applications
By Robert I. SoareThis book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic.
-
The Foundations of Computability Theory
By Borut RobicThis book offers an original and informative view of the development of fundamental concepts of computability theory.
-
Computability Theory: An Introduction to Recursion Theory
By Herbert B. EndertonThis presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. aThe text includes both the standard material for a first course in ...
-
Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures
By Dov M. Gabbay, S. Abramsky, T. S. E. MaibaumThe latest volume in this major reference work covers all major areas of application of logic and theoretical computer science
-
Handbook of Mathematical Models for Languages and Computation
By Alexander Meduna, Martin TomkoThis handbook introduces a variety of concepts in discrete mathematics and mathematical modeling for languages and computation.