Towards computability over effectively enumerable topological spaces

DOI10.1016/J.ENTCS.2008.12.011MaRDI QIDQ4918009zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computabilityeffective continuitycomputably enumerable topological space

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computable elements and functions in effectively enumerable topological spaces
• Effectively enumerable topological spaces
• Effectivity on continuous functions in topological spaces
• Rice's theorem in effectively enumerable topological spaces
• Effective continuities on effective topological spaces

Cites work

• scientific article; zbMATH DE number 3132764 (Why is no real title available?)
• scientific article; zbMATH DE number 3896924 (Why is no real title available?)
• scientific article; zbMATH DE number 3664931 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 783754 (Why is no real title available?)
• scientific article; zbMATH DE number 3285221 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A domain-theoretic approach to computability on the real line
• An Effective Operator, Continuous but not Partial Recursive
• An effective Riemann Mapping Theorem
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computability on subsets of metric spaces.
• Computability theory in admissible domains
• Continuous Lattices and Domains
• Effective operations on partial recursive functions
• Is the Mandelbrot set computable?
• On effective topological spaces
• Recursive metric spaces
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
• Towards computability over effectively enumerable topological spaces

Cited in

(26)

• On the difference hierarchy in countably based \(T_{0}\)-spaces
• Some notes on spaces of ideals and computable topology
• Computable elements and functions in effectively enumerable topological spaces
• scientific article; zbMATH DE number 1746048 (Why is no real title available?)
• On higher effective descriptive set theory
• Outline of partial computability in computable topology
• Positive predicate structures for continuous data
• Computable one-to-one enumerations of effective domains
• On images of partial computable functions over computable Polish spaces
• COMPUTABLY COMPACT METRIC SPACES
• scientific article; zbMATH DE number 7360045 (Why is no real title available?)
• scientific article; zbMATH DE number 1746047 (Why is no real title available?)
• 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
• Rice's theorem in effectively enumerable topological spaces
• A comparison of concepts from computable analysis and effective descriptive set theory
• scientific article; zbMATH DE number 4152362 (Why is no real title available?)
• 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

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)