| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421992 | Electronic Notes in Theoretical Computer Science | 2008 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
