Handbook of computability theory

New York: Elsevier (1999)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
Computable Presentations of C*-Algebras.F. O. X. Alec - 2024 - Journal of Symbolic Logic 89 (3):1313-1338.
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Theory of Logical Calculi: Basic Theory of Consequence Operations.Ryszard Wójcicki - 1988 - Dordrecht, Boston and London: Kluwer Academic Publishers.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
Definitions of Numbers and Their Applications.Philip A. Ebert & Marcus Rossberg - 2016 - In Philip A. Ebert & Marcus Rossberg, Abstractionism: Essays in Philosophy of Mathematics. Oxford, England: Oxford University Press UK. pp. 332-348.

Analytics

Added to PP
2009-01-28

Downloads
68 (#876,064)

6 months
18 (#641,465)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

An effectively closed set with no join property.Ahmet Çevik - 2021 - Mathematical Logic Quarterly 67 (3):313-320.
New substitution bases for complexity classes.Stefano Mazzanti - 2020 - Mathematical Logic Quarterly 66 (1):37-50.
An isomorphism theorem for partial numberings.Dieter Spreen - 2014 - In Vasco Brattka, Hannes Diener & Dieter Spreen, Logic, Computation, Hierarchies. Berlin, Boston: De Gruyter. pp. 341-382.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references