Computable elements and functions in effectively enumerable topological spaces

DOI10.1017/S0960129516000141zbMath1475.03092OpenAlexW2464649310MaRDI QIDQ4593240

Oleg V. Kudinov, Margarita Korovina

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129516000141

zbMATH Keywords

recursion theorycomputable analysisRice's theoremeffectively enumerable topological spacesfamilies of basic neighbourhoods

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)

Related Items

On images of partial computable functions over computable Polish spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively closed sets and enumerations
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Total sets and objects in domain theory
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Index sets in computable analysis
• Index sets for \(\Pi^0_1\) classes
• Computable structures and the hyperarithmetical hierarchy
• Computability on computable metric spaces
• On some decision problems in programming
• Three theorems on the degrees of recursively enumerable sets
• On degrees of unsolvability
• Spectra of highn and non-lown degrees
• Weihrauch degrees, omniscience principles and weak computability
• On Σ‐definability without equality over the real numbers
• Index sets of computable structures
• Borel Complexity of Topological Operations on Computable Metric Spaces
• The Uniformity Principle for  -definability
• A hierarchy of families of recursively enumerable degrees
• A finiteness theorem for open semi-algebraic sets, with applications to Hilbert’s 17th problem
• Theorie der Numerierungen I
• On effective topological spaces
• Towards Computability over Effectively Enumerable Topological Spaces
• On Computable Metrization
• Hyperprojective Hierarchy of qcb0-Spaces
• Computer Science Logic
• Normal numbers and the Borel hierarchy
• Index sets for classes of high rank structures
• On the Degrees of Index Sets. II
• Recursive metric spaces
• Mean value theorems in constructive analysis
• New Computational Paradigms
• Positive predicate structures for continuous data