Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Handbook of logic in computer science (vol. 3)
A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
An effective Riemann mapping theorem
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
Computability theory in admissible domains
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
| Hi-index | 0.00 |
In this paper we study different approaches to computability over effectively enumerable topological spaces. We introduce and investigate the notions of computable function, strongly-computable function and weakly-computable function. Under natural assumptions on effectively enumerable topological spaces the notions of computability and weakly-computability coincide.