22 citations · 57 across the 23 of their papers we have counts for
5 papers · 1 filter
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable
Cristobal Rojas, Michael Yampolsky
We consider the simplest non-linear discrete dynamical systems, given by the logistic maps of the interval . We show that there exist real parameters $a\i…
On the computability properties of topological entropy: a general approach
Silvere Gangloff, Alonso Herrera, Cristobal Rojas +1
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, th…
Space-bounded Church-Turing thesis and computational tractability of closed systems
Mark Braverman, Cristobal Rojas, Jonathan Schneider
We report a new limitation on the ability of physical systems to perform computation -- one that is based on generalizing the notion of memory, or storage space, available to the s…
Real quadratic Julia sets can have arbitrarily high complexity
Cristobal Rojas, Michael Yampolsky
We show that there exist real parameters for which the Julia set of the quadratic map has arbitrarily high computational complexity. More precisely, we show that…
Computability on quasi-Polish spaces
Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov +1
We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open…