scientific article; zbMATH DE number 3143695
From MaRDI portal
Publication:3260574
Cited in
(36)- Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
- Continuous optimization problems and a polynomial hierarchy of real functions
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
- A notion of mechanistic theory
- Relatively recursive reals and real functions
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Semicomputable manifolds in computable topological spaces
- On the computational complexity of best Chebyshev approximations
- Computability of products of chainable continua
- Computable subcontinua of semicomputable chainable Hausdorff continua
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- On the Computable Theory of Bounded Analytic Functions
- Computability and analysis, a historical approach
- Singular coverings and non‐uniform notions of closed set computability
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Singular coverings and non-uniform notions of closed set computability
- Computable complex analysis
- Weihrauch Complexity in Computable Analysis
- Computable neighbourhoods of points in semicomputable manifolds
- Computability of graphs
- Foundations of online structure theory. II: The operator approach
- Notes on computable analysis
- The prime number theorem is PRA-provable
- Computable approximations of a chainable continuum with a computable endpoint
- COMPUTABLY COMPACT METRIC SPACES
- Semantics, specification logic, and Hoare logic of exact real computation
- Computably and punctually universal spaces
- Second-order parameterizations for the complexity theory of integrable functions
- Computable subcontinua of circularly chainable continua
- Computable type of certain quotient spaces
- Computability of chainable graphs
- Co-c.e. sets with disconnected complements
- Computable type and computably categorical spaces
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
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 Q3260574)
