Towards computability over effectively enumerable topological spaces
From MaRDI portal
Publication:4918009
DOI10.1016/J.ENTCS.2008.12.011zbMATH Open1262.03073OpenAlexW2051039879MaRDI QIDQ4918009FDOQ4918009
Authors: Oleg Kudinov, M. V. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Continuous Lattices and Domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- An effective Riemann Mapping Theorem
- On effective topological spaces
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Computability on subsets of metric spaces.
- Is the Mandelbrot set computable?
- Title not available (Why is that?)
- Effective operations on partial recursive functions
- Title not available (Why is that?)
- Towards computability over effectively enumerable topological spaces
- Computability theory in admissible domains
- Recursive metric spaces
- A domain-theoretic approach to computability on the real line
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
- An Effective Operator, Continuous but not Partial Recursive
Cited In (26)
- Some notes on spaces of ideals and computable topology
- Computable elements and functions in effectively enumerable topological spaces
- Title not available (Why is that?)
- On higher effective descriptive set theory
- Outline of partial computability in computable topology
- Positive predicate structures for continuous data
- COMPUTABLY COMPACT METRIC SPACES
- Computable one-to-one enumerations of effective domains
- On images of partial computable functions over computable Polish spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genericity of weakly computable objects
- Effectively enumerable topological spaces
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computability by means of effectively definable schemes and definability via enumerations
- The Rice-Shapiro theorem in computable topology
- A comparison of concepts from computable analysis and effective descriptive set theory
- Rice's theorem in effectively enumerable topological spaces
- Title not available (Why is that?)
- Weak reduction principle and computable metric spaces
- Towards computability over effectively enumerable topological spaces
- Highlights of the Rice-Shapiro theorem in computable topology
- On homeomorphisms of effective topological spaces
- Topological spaces over algorithmic representations of universal algebras
- Effective topological spaces. III: Forcing and definability
- On the difference hierarchy in countably based \(T_{0}\)-spaces
This page was built for publication: Towards computability over effectively enumerable topological spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918009)