Towards Computability over Effectively Enumerable Topological Spaces
From MaRDI portal
Publication:4918009
DOI10.1016/j.entcs.2008.12.011zbMath1262.03073OpenAlexW2051039879MaRDI QIDQ4918009
Oleg V. Kudinov, Margarita Korovina
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.011
Related Items (12)
Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ On images of partial computable functions over computable Polish spaces ⋮ Unnamed Item ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Towards Computability over Effectively Enumerable Topological Spaces ⋮ On the Difference Hierarchy in Countably Based T0-Spaces ⋮ Positive predicate structures for continuous data ⋮ Outline of partial computability in computable topology ⋮ On higher effective descriptive set theory ⋮ Some notes on spaces of ideals and computable topology
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A domain-theoretic approach to computability on the real line
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- An effective Riemann Mapping Theorem
- Computability on subsets of metric spaces.
- Is the Mandelbrot set computable?
- Effective operations on partial recursive functions
- On effective topological spaces
- Continuous Lattices and Domains
- Towards Computability over Effectively Enumerable Topological Spaces
- Computability theory in admissible domains
- The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
- An Effective Operator, Continuous but not Partial Recursive
- Recursive metric spaces
This page was built for publication: Towards Computability over Effectively Enumerable Topological Spaces
