Skip to main content

Effective Representations

  • Chapter
Computability

Part of the book series: EATCS Monographs on Theoretical Computer Science ((EATCS,volume 9))

  • 202 Accesses

Abstract

It cannot be expected that arbitrary representations have interesting constructive or computational properties. In this chapter we introduce some types of “effective” representations. For any topological space with To-topology and countable base a distinguished equivalence class of effective representations (the admissible representations) can be introduced by natural topological requirements. These requirements correspond to the axiomatic characterization of the numbering φ of the partial recursive functions by the smn-theorem and the utm-theorem (see Chapter 2.1). Final topologies which play an important role in this theory are studied in advance. Admissible representations have several natural properties; especially for admissible representations of To-spaces topological continuity coincides with continuity w.r.t. the representations. For any given numbering of a base of a To-space, we define the computationally admissible representations. For separable metric spaces the Cauchy-representations are introduced which turn out to be admissible. The concept of admissible representations is sufficiently powerful in order to define constructivity and computability in a natural way in functional analysis and measure theory.

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

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

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Weihrauch, K. (1987). Effective Representations. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69965-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-69967-2

  • Online ISBN: 978-3-642-69965-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics