Skip to main content

8. Some Extensions

  • Chapter
  • 530 Accesses

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

Abstract

In this book, we study computability concepts which are induced by notations and representations. Although every representation δ :⊆ ΣωM of a set induces a computability concept, only very few of them are useful. As an important class we have studied representations constructed from computable topological spaces (Sect. 3.2). Remember that every To-space with countable base can be extended to a computable topological space by an injective notation of a subbase. Many important To-spaces with countable base can be generated from separable metric spaces (Definition 2.2.1). Therefore, it is useful to study computability on metric spaces separately. The reader who is not familiar with the mathematical concepts used in this section is referred to any standard textbook on real analysis, for example, Rudin [Rud64].

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

Buying options

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

Learn about 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). 8. Some Extensions. In: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56999-9_8

Download citation

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

  • 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