Towards Computability over Effectively Enumerable Topological Spaces

Margarita Korovina, Oleg Kudinov

Electronic Notes in Theoretical Computer Science · 2008 · 20 citations · 14 references

DOIFull text

Open access

Concepts

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.

References

14