ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 262, Issues 1-2, 6 July 2001, Pages 473-499
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (217 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(00)00319-4    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2001 Elsevier Science B.V. All rights reserved.

Representations versus numberings: on the relationship of two computability notions

Dieter SpreenCorresponding Author Contact Information, E-mail The Corresponding Author

Fachbereich Mathematik, AG Theoretische Informatik, Universität-GH Siegen, D-57068 Siegen, Germany

Received 15 October 1997;
revised 15 April 2000;
accepted 18 July 2000.
Communicated by G. Rozenberg.
Available online 15 June 2001.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

This paper gives an answer to Weihrauch's (Computability, Springer, Berlin, 1987) question whether and, if not always, when an effective map between the computable elements of two represented sets can be extended to a (partial) computable map between the represented sets. Examples are known showing that this is not possible in general. A condition is introduced and for countably based topological T0-spaces it is shown that exactly the (partial) effective maps meeting the requirement are extendable. For total effective maps the extra condition is satisfied in the standard cases of effectively given separable metric spaces and continuous directed-complete partial orders, in which the extendability is already known. In the first case a similar result holds also for partial effective maps, but not in the second.

Author Keywords: Computability theory; Numbering theory; Theory of representations; Type two theory of effectivity; Computable operators; Effective operators; Continuity problem; Effectively given topological spaces


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.