Computability of Subsets of Metric Spaces
From MaRDI portal
Publication:5024568
DOI10.1007/978-3-030-59234-9_2OpenAlexW3173135134MaRDI QIDQ5024568
Zvonko Iljazović, Takayuki Kihara
Publication date: 26 January 2022
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-59234-9_2
Related Items (3)
Computable Stone spaces ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implicit definability in arithmetic
- Closed choice and a uniform low basis theorem
- Computable neighbourhoods of points in semicomputable manifolds
- Notes on computable analysis
- Curves that must be retraced
- Dynamics and abstract computability: computing invariant measures
- Computing space-filling curves
- Co-c.e. sets with disconnected complements
- Mass problems associated with effectively closed sets
- Computability of measurable sets via effective topologies
- Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
- \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination
- Realizability. An introduction to its categorical side
- First level Borel functions and isomorphisms
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Markov's constructive analysis; a participant's view
- Effective properties of sets and functions in metric spaces with computability structure
- Classical recursion theory. Vol. II
- Computability on subsets of metric spaces.
- Extended admissibility.
- Semicomputable manifolds in computable topological spaces
- Computability on computable metric spaces
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Countable retracing functions and \(\Pi_2^0\) predicates
- A model of set-theory in which every set of reals is Lebesgue measurable
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Randomness for non-computable measures
- Compact manifolds with computable boundaries
- Representations of measurable sets in computable measure theory
- A Survey of Mučnik and Medvedev Degrees
- Local computability of computable metric spaces and computability of co-c.e. continua
- Borel-Piecewise Continuous Reducibility for Uniformization Problems
- Elements of Differential Topology
- On Recursive Trees with a Unique Infinite Branch
- A lambda calculus for real analysis
- Effective Borel measurability and reducibility of functions
- Computable operators on regular sets
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces
- Co-c.e. spheres and cells in computable metric spaces
- Effective Borel degrees of some topological functions
- Finite choice, convex choice and finding roots
- Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
- Singular coverings and non‐uniform notions of closed set computability
- Borel Complexity of Topological Operations on Computable Metric Spaces
- Plottable Real Number Functions and the Computable Graph Theorem
- The space of class $\alpha$ Baire functions
- A comparison of concepts from computable analysis and effective descriptive set theory
- Computable intersection points
- Descriptive Set Theory in the Category of Represented Spaces
- Computability on Regular Subsets of Euclidean Space
- Incomputability of Simply Connected Planar Continua
- The power of backtracking and the confinement of length
- A Comparison of Certain Representations of Regularly Closed Sets
- Effectiveness for Embedded Spheres and Balls
- Computability of 1-manifolds
- Levels of discontinuity, limit-computability, and jump operators
- Decomposing Borel functions using the Shore–Slaman join theorem
- Turing degrees in Polish spaces and decomposability of Borel functions
- Non-deterministic computation and the Jayne-Rogers Theorem
- HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC
- Computable planar curves intersect in a computable point
- Connected choice and the Brouwer fixed point theorem
- Effective zero-dimensionality for computable metric spaces
- Foundations for Computable Topology
- MAXIMAL COMPUTABILITY STRUCTURES
- Degrees of unsolvability of continuous functions
- Classes of Polish spaces under effective Borel isomorphism
- Computably Isometric Spaces
- On local non‐compactness in recursive mathematics
- On the Cardinality of $$ \sum_2^1 $$ Sets of Reals
- A characterization of ℵ0-spaces
- ∏ 0 1 Classes and Degrees of Theories
- Computability of measurable sets via effective metrics
- On the topological aspects of the theory of represented spaces
- An injection from the Baire space to natural numbers
- A Separation Theorem for ∑ 1 1 Sets
This page was built for publication: Computability of Subsets of Metric Spaces
