Electronic Notes in Theoretical Computer Science · 2008 · 20 citations · 14 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsTopologyComputability TheoryComputational TopologyTopological SpacesComputabilityEffective ComputabilityEnumerability
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.
14
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Samson Abramsky, Achim Jung · Logic in Computer Science · 1995 · 917 citations
Douglas Bridges · CUBO, A Mathematical Journal · 2004 · 373 citations
Computability on subsets of metric spaces
Vasco Brattka, Gero Presser · Theoretical Computer Science · 2003 · 163 citations