Elementary computable topology
From MaRDI portal
Recommendations
Cited in
(42)- Computable Polish group actions
- Computing conformal maps of finitely connected domains onto canonical slit domains
- Every \(\Delta^0_2\) Polish space is computable topological
- Some notes on spaces of ideals and computable topology
- Computable approximations of a chainable continuum with a computable endpoint
- Separating notions in effective topology
- On the topological aspects of the theory of represented spaces
- Computable elements and functions in effectively enumerable topological spaces
- Admissibly Represented Spaces and Qcb-Spaces
- Computability of Subsets of Metric Spaces
- Intersection points of planar curves can be computed
- Computable soft separation axioms
- Computable separation in topology, from T₀ to T₃
- Computability of Polish spaces up to homeomorphism
- On the computational content of the Lawson topology
- COMPUTABLY COMPACT METRIC SPACES
- Automated reasoning about elementary point-set topology
- Computability of chainable graphs
- Products of effective topological spaces and a uniformly computable Tychonoff theorem
- Semantics of computable physical models
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computability of products of chainable continua
- Computable subcontinua of semicomputable chainable Hausdorff continua
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- Rice's theorem in effectively enumerable topological spaces
- Computability on measurable functions
- Synthetic topology: of data types and classical spaces
- Computable type of certain quotient spaces
- Unified characterizations of lowness properties via Kolmogorov complexity
- Schnorr triviality and its equivalent notions
- Multi-representation associated to the numbering of a subbasis and formal inclusion relations
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Characterization of Kurtz randomness by a differentiation theorem
- Effective bases and notions of effective second countability in computable analysis
- Computable analysis with applications to dynamic systems
- Effective second countability in computable analysis
- scientific article; zbMATH DE number 3924775 (Why is no real title available?)
- Semicomputable manifolds in computable topological spaces
- Computable separation in topology, from \(T_{0}\) to \(T_{2}\)
- Computable Stone spaces
- Effective Riemann mappings of multiply connected domains and Riemann surfaces
- Computable topological groups
This page was built for publication: Elementary computable topology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639070)
