The following pages link to Cristobal Rojas (Q406297):
Displaying 37 items.
- Computable Carathéodory theory (Q406298) (← links)
- Coding discretizations of continuous functions (Q533761) (← links)
- Randomness on computable probability spaces -- a dynamical point of view (Q537913) (← links)
- (Q628763) (redirect page) (← links)
- Dynamics and abstract computability: computing invariant measures (Q628764) (← links)
- Computability of Brolin-Lyubich measure (Q651408) (← links)
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties (Q1019738) (← links)
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy (Q1049402) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- Non computable Mandelbrot-like sets for a one-parameter complex family (Q1784950) (← links)
- Carathéodory convergence and harmonic measure (Q2009088) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- Computability on quasi-Polish spaces (Q2179336) (← links)
- Non-computable impressions of computable external rays of quadratic polynomials (Q2339170) (← links)
- Computability of probability measures and Martin-Löf randomness over metric spaces (Q2389335) (← links)
- Statistical properties of dynamical systems -- Simulation and abstract computation (Q2393223) (← links)
- Computational intractability of attractors in the real quadratic family (Q2417754) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Real quadratic Julia sets can have arbitrarily high complexity (Q2658550) (← links)
- Computability in harmonic analysis (Q2671298) (← links)
- Realizing semicomputable simplices by computable dynamical systems (Q2676461) (← links)
- Noise vs computational intractability in dynamics (Q2826049) (← links)
- Schnorr randomness and the Lebesgue differentiation theorem (Q2862195) (← links)
- (Q2955015) (← links)
- Computability of the Radon-Nikodym Derivative (Q3091448) (← links)
- An Application of Martin-Löf Randomness to Effective Probability Theory (Q3576058) (← links)
- Applications of Effective Probability Theory to Martin-Löf Randomness (Q3638062) (← links)
- Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
- Computable Geometric Complex Analysis and Complex Dynamics (Q5024571) (← links)
- How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable (Q5144992) (← links)
- (Q5150971) (← links)
- Randomness on computable probability spaces - A dynamical point of view (Q5390000) (← links)
- Computability and information in models of randomness and chaos (Q5458068) (← links)
- Probability, statistics and computation in dynamical systems (Q5740360) (← links)
- Effective dynamical systems beyond dimension zero and factors of SFTs (Q6517501) (← links)
- On the complexity of the Eulerian path problem for infinite graphs (Q6743114) (← links)
- Ulam meets Turing: constructing quadratic maps with non-computable SRB measures (Q6760478) (← links)
