Computability on computable metric spaces
Author:
- Klaus WeihrauchKWKlaus Weihrauch
- 1 June 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 113 (2) , 191-210
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the complexity of online computations of real functionsJournal of Complexity, 1991
- Type 2 computational complexity of functions on Cantor's spaceTheoretical Computer Science, 1991
- Constructivity, computability, and computational complexity in analysisLecture Notes in Computer Science, 1989
- Representations of the real numbers and of the open subsets of the set of real numbersAnnals of Pure and Applied Logic, 1987
- Type 2 recursion theoryTheoretical Computer Science, 1985
- Theory of representationsTheoretical Computer Science, 1985
- A unified approach to constructive and recursive analysis1984
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Computational complexity of real functionsTheoretical Computer Science, 1982
- Embedding metric spaces into CPO'sTheoretical Computer Science, 1981