scientific article; zbMATH DE number 3112803

Cited in

(35)

Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
A domain-theoretic approach to computability on the real line
Index sets in computable analysis
Computable Banach spaces via domain theory
An effective Riemann Mapping Theorem
From axiomatics to intrinsic characterization: some open problems in computable analysis
Concrete models of computation for topological algebras
Computation by `While' programs on topological partial algebras
Computability structure of the Sobolev spaces and its applications
Recursive characterization of computable real-valued functions and relations
A topological view on algebraic computation models
A survey of recursive analysis and Moore's notion of real computation
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
Algorithmic randomness and Fourier analysis
Computability, noncomputability, and hyperbolic systems
Models of computation for partial functions on the reals
Parametrised second-order complexity theory with applications to the study of interval computation
Polynomial differential equations compute all real computable functions on computable compact intervals
Analytical properties of resource-bounded real functionals
Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
Computation with perturbed dynamical systems
Computability, noncomputability and undecidability of maximal intervals of IVPs
Dimension spectra of random subfractals of self-similar fractals
A Real Number Structure that is Effectively Categorical
L^p‐Computability
Computable complex analysis
Algorithmic Fractal Dimensions in Geometric Measure Theory
Three topological reducibilities for discontinuous functions
Physical computability theses
Notes on computable analysis
Feferman on computability
Computational unsolvability of domains of attraction of nonlinear systems
Theoretical computer science: computability, decidability and logic
Title not available (Why is no real title available?)

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 Q3226754)