Computing over the reals: foundations for scientific computing.
From MaRDI portal
Publication:3373046
zbMATH Open1092.68038MaRDI QIDQ3373046FDOQ3373046
Authors: Mark Braverman, Stephen Cook 
Publication date: 13 March 2006
Full work available at URL: http://www.ams.org/notices/200603/fea-cook.pdf
Recommendations
Fractals (28A80) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Constructive and recursive analysis (03F60)
Cited In (45)
- Computable Complex Analysis
- Dimension spectra of random subfractals of self-similar fractals
- Computational complexity of classical solutions of partial differential equations
- An extension of chaotic probability models to real-valued variables
- Algorithmic randomness and Fourier analysis
- A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\)
- Curves that must be retraced
- The dependence of computability on numerical notations
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Average-case bit-complexity theory of real functions
- Computability Models: Algebraic, Topological and Geometric Algorithms
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Three lectures on real computation
- On choosing the correct model for computability over the reals
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Fractals via iterated functions and multifunctions
- On the Computable Theory of Bounded Analytic Functions
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Theses for computation and recursion on concrete and abstract structures
- The Digital and the Real World
- Complexity of approximating functions on real-life computers
- Mutual dimension
- Computable de Finetti measures
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
- Recursive analysis of singular ordinary differential equations
- Computable symbolic dynamics
- Title not available (Why is that?)
- Computer Science for Continuous Data
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computability and dynamical systems
- Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set
- Points on Computable Curves of Computable Lengths
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Seven kinds of computable and constructive infelicities in economics
- Title not available (Why is that?)
- Title not available (Why is that?)
- A computability challenge: asymptotic bounds for error-correcting codes
- Computing equilibria: a computational complexity perspective
- Multi-resolution cellular automata for real computation
- The rate of convergence of the walk on spheres algorithm
- Feferman on Computability
- On the non-sequential nature of the interval-domain model of real-number computation
This page was built for publication: Computing over the reals: foundations for scientific computing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373046)
