The following pages link to (Q3373046):
Displaying 35 items.
- Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- Curves that must be retraced (Q550254) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Fractals via iterated functions and multifunctions (Q711997) (← links)
- Computable de Finetti measures (Q764273) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- An extension of chaotic probability models to real-valued variables (Q962886) (← links)
- The rate of convergence of the walk on spheres algorithm (Q1938493) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Computational complexity of classical solutions of partial differential equations (Q2104279) (← links)
- Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
- A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\) (Q2517499) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Mutual Dimension (Q2832303) (← links)
- On the Computable Theory of Bounded Analytic Functions (Q2866157) (← links)
- Rohlin properties for $\mathbb{Z}^{d}$ actions on the Cantor set (Q2880675) (← links)
- A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (Q2891310) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Points on Computable Curves of Computable Lengths (Q3182970) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems (Q3380363) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
- Seven Kinds of Computable and Constructive Infelicities in Economics (Q4598050) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Computable Complex Analysis (Q5024570) (← links)
- Algorithmic Fractal Dimensions in Geometric Measure Theory (Q5024574) (← links)
- Feferman on Computability (Q5214780) (← links)
- Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)
- The dependence of computability on numerical notations (Q6088491) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
