scientific article; zbMATH DE number 1969324
From MaRDI portal
Publication:4422786
Recommendations
Cited in
(42)- Topological properties of real number representations.
- Extended admissibility.
- Comparing Cartesian closed categories of (core) compactly generated spaces
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- On the computability of the set of automorphisms of the unit square
- On envelopes and backward approximations
- Quantitative coding and complexity theory of compact metric spaces
- The fixed-point property for represented spaces
- Parametrised second-order complexity theory with applications to the study of interval computation
- Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
- Stability of representations of effective partial algebras
- Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
- A uniformly computable Implicit Function Theorem
- scientific article; zbMATH DE number 1746044 (Why is no real title available?)
- On computability and disintegration
- A comparison of concepts from computable analysis and effective descriptive set theory
- A natural weak limit space with admissible representation which is not a limit space
- Computable Riesz representation for locally compact Hausdorff spaces
- Effectivity on continuous functions in topological spaces
- Admissible representations of probability measures
- Computable Riesz representation for the dual of \(C[0;1]\)
- Observationally-induced lower and upper powerspace constructions
- Computable analysis and notions of continuity in \textsc{Coq}
- Representations and evaluation strategies for feasibly approximable functions
- Computability of Subsets of Metric Spaces
- Admissibly Represented Spaces and Qcb-Spaces
- Continuous and monotone machines
- Decision problems for linear recurrences involving arbitrary real numbers
- Computable analysis with applications to dynamic systems
- Connected choice and the Brouwer fixed point theorem
- Computable metrization
- Observationally-induced effect monads: upper and lower powerspace constructions
- Weihrauch goes Brouwerian
- Quantitative continuity and Computable Analysis in Coq
- A computable and compositional semantics for hybrid systems
- Descriptive complexity on non-Polish spaces. II
- Effective second countability in computable analysis
- Sequential discontinuity and first-order problems
- Effective bases and notions of effective second countability in computable analysis
- Deciding robust instances of an escape problem for dynamical systems in Euclidean space
- Computability of measurable sets via effective topologies
- Comparing free algebras in topological and classical domain theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422786)
