Computing over the reals: foundations for scientific computing.
From MaRDI portal
(Redirected from Publication:3373046)
Recommendations
Cited in
(51)- A refined model of computation for continuous problems
- The rate of convergence of the walk on spheres algorithm
- Algorithmic randomness and Fourier analysis
- Computational complexity of classical solutions of partial differential equations
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Execution trace sets for real computation
- Three lectures on real computation
- On choosing the correct model for computability over the reals
- Average-case bit-complexity theory of real functions
- Mutual dimension
- On the Computable Theory of Bounded Analytic Functions
- Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set
- A computability challenge: asymptotic bounds for error-correcting codes
- Computability and dynamical systems
- Multi-resolution cellular automata for real computation
- Points on Computable Curves of Computable Lengths
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems
- Computable symbolic dynamics
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Dimension spectra of random subfractals of self-similar fractals
- scientific article; zbMATH DE number 176208 (Why is no real title available?)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- scientific article; zbMATH DE number 1070470 (Why is no real title available?)
- Seven kinds of computable and constructive infelicities in economics
- The Digital and the Real World
- Theses for computation and recursion on concrete and abstract structures
- On the non-sequential nature of the interval-domain model of real-number computation
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- scientific article; zbMATH DE number 1405639 (Why is no real title available?)
- scientific article; zbMATH DE number 1418482 (Why is no real title available?)
- Computable complex analysis
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Feferman on computability
- Complexity of approximating functions on real-life computers
- Curves that must be retraced
- Computability Models: Algebraic, Topological and Geometric Algorithms
- The dependence of computability on numerical notations
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Recursive analysis of singular ordinary differential equations
- Computer Science for Continuous Data
- Second-order parameterizations for the complexity theory of integrable functions
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- Fractals via iterated functions and multifunctions
- Computable de Finetti measures
- Computing equilibria: a computational complexity perspective
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
- An extension of chaotic probability models to real-valued variables
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)
