Skip to main content

4. Computability on the Real Numbers

  • Chapter
Computable Analysis

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

  • 555 Accesses

Abstract

Real numbers are the basic objects in analysis. For most non-mathematicians a real number is an infinite decimal fraction, for example π = 3●14159 .... Mathematicians prefer to define the real numbers axiomatically as follows: (ℝ, +,·,0,1, <) is, up to isomorphism, the only Archimedean ordered field satisfying the axiom of continuity [Die60]. The set of real numbers can also be constructed in various ways, for example by means of Dedekind cuts or by completion of the (metric space of) rational numbers. We will neglect all foundational problems and assume that the real numbers form a well-defined set ℝ with all the properties which are proved in analysis. We will denote the real line topology, that is, the set of all open subsets of ℝ, by τ.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Weihrauch, K. (2000). 4. Computability on the Real Numbers. In: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56999-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56999-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66817-6

  • Online ISBN: 978-3-642-56999-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics