Computable elements and functions in effectively enumerable topological spaces

DOI10.1017/S0960129516000141MaRDI QIDQ4593240zbMATH OpenOpenAlexFDO

Authors Oleg Kudinov, M. V. 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

computable analysisrecursion theoryRice's theoremeffectively enumerable topological spacesfamilies of basic neighbourhoods

Mathematics Subject Classification ID

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

Recommendations

• Rice's theorem in effectively enumerable topological spaces
• Towards computability over effectively enumerable topological spaces
• Index sets in computable analysis
• Effectively enumerable topological spaces
• Highlights of the Rice-Shapiro theorem in computable topology

Cites work

• scientific article; zbMATH DE number 3867312 (Why is no real title available?)
• scientific article; zbMATH DE number 6536309 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (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 2167522 (Why is no real title available?)
• scientific article; zbMATH DE number 1834650 (Why is no real title available?)
• scientific article; zbMATH DE number 1390024 (Why is no real title available?)
• scientific article; zbMATH DE number 3428899 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A finiteness theorem for open semi-algebraic sets, with applications to Hilbert’s 17th problem
• A hierarchy of families of recursively enumerable degrees
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Computability on computable metric spaces
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computable structures and the hyperarithmetical hierarchy
• Computer Science Logic
• Effectively closed sets and enumerations
• Elementary computable topology
• Gandy's theorem for abstract structures without the equality test
• Hyperprojective hierarchy of \(\mathrm{qcb}_{0}\)-spaces
• Index sets for ^0_1 classes
• Index sets for classes of high rank structures
• Index sets in computable analysis
• Index sets of computable structures
• Mean value theorems in constructive analysis
• New Computational Paradigms
• Normal numbers and the Borel hierarchy
• On computable metrization
• On degrees of unsolvability
• On effective topological spaces
• On some decision problems in programming
• On the Degrees of Index Sets. II
• On Σ‐definability without equality over the real numbers
• Positive predicate structures for continuous data
• Recursive metric spaces
• Spectra of high_n and non-low_n degrees
• The Uniformity Principle for  -definability
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Theorie der Numerierungen I
• Three theorems on the degrees of recursively enumerable sets
• Total sets and objects in domain theory
• Towards computability over effectively enumerable topological spaces
• Weihrauch degrees, omniscience principles and weak computability

Cited in

(9)

• Index sets as a measure of continuous constraint complexity
• Outline of partial computability in computable topology
• Computable one-to-one enumerations of effective domains
• On images of partial computable functions over computable Polish spaces
• Products of effective topological spaces and a uniformly computable Tychonoff theorem
• Rice's theorem in effectively enumerable topological spaces
• Weak reduction principle and computable metric spaces
• Towards computability over effectively enumerable topological spaces
• Effective bases and notions of effective second countability in computable analysis

This page was built for publication: Computable elements and functions in effectively enumerable topological spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593240)