scientific article
From MaRDI portal
Publication:3373046
zbMath1092.68038MaRDI QIDQ3373046
Mark Braverman, Stephen A. Cook
Publication date: 13 March 2006
Full work available at URL: http://www.ams.org/notices/200603/fea-cook.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Constructive and recursive analysis (03F60) Fractals (28A80) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10)
Related Items (35)
Rohlin properties for $\mathbb{Z}^{d}$ actions on the Cantor set ⋮ Computability Models: Algebraic, Topological and Geometric Algorithms ⋮ A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes ⋮ Computability and Dynamical Systems ⋮ Computing equilibria: a computational complexity perspective ⋮ Points on Computable Curves of Computable Lengths ⋮ Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Dimension spectra of random subfractals of self-similar fractals ⋮ The dependence of computability on numerical notations ⋮ The rate of convergence of the walk on spheres algorithm ⋮ Seven Kinds of Computable and Constructive Infelicities in Economics ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Recursive analysis of singular ordinary differential equations ⋮ Computable symbolic dynamics ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Algorithmic randomness and Fourier analysis ⋮ An extension of chaotic probability models to real-valued variables ⋮ Curves that must be retraced ⋮ Fractals via iterated functions and multifunctions ⋮ A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\) ⋮ Feferman on Computability ⋮ Towards understanding the theoretical challenges of numerical modeling of dynamical systems ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ Multi-Resolution Cellular Automata for Real Computation ⋮ Computable de Finetti measures ⋮ Mutual Dimension ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computable Complex Analysis ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations
This page was built for publication:
