• Computability on computable me...

Treffer: Computability on computable metric spaces

Title:
Computability on computable metric spaces
Authors:
WEIHRAUCH, K
Source:
Theoretical computer science. 113(2):191-210
Publisher Information:
Amsterdam: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Calculabilité, Computability, Calculabilidad, Complexité calcul, Computing complexity, Complejidad cálculo, Espace métrique, Metric space
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Fernuniv. Hagen, Fachbereich Informatik, 5800 Hagen, Germany
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4810406
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4810406
Database:
PASCAL Archive

Weitere Informationen

In previous papers [e.g. Weihrauch (1987)], «Type 2 theory of effectivity» (TTE) has been shown to be a very general and powerful computer-oriented theory for studying effectivity in mathematics. In this contribution computability on certain «computable» separable metric spaces is studied in detail by applying the framework of TTE. Computationally admissible representations of metric spaces are introduced after showing that four different «effective» representations are computationally equivalent. For extending computability to the set of continuous functions, several effective namings which are related to definitions of continuity are introduced and compared. The definitions are used to prove effective Gδ-extension theorems for continuous functions and an effective Gδ-characterization of the domains of «strongly continuous» functions which generalize the known properties of real functions [Kreitz (1984)].