Cristobal Rojas

Orcid: 0000-0002-9037-6102

According to our database1, Cristobal Rojas authored at least 32 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On dimensionality of feature vectors in MPNNs.
CoRR, 2024

2023
On the algorithmic descriptive complexity of attractors in topological dynamics.
CoRR, 2023

Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

No Agreement Without Loss: Learning and Social Choice in Peer Review.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Find a witness or shatter: the landscape of computable PAC learning.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Realizing semicomputable simplices by computable dynamical systems.
Theor. Comput. Sci., 2022

Computability in Harmonic Analysis.
Found. Comput. Math., 2022

2021
Real Quadratic Julia Sets Can Have Arbitrarily High Complexity.
Found. Comput. Math., 2021

2020
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
On the computability properties of topological entropy: a general approach.
CoRR, 2019

Space-bounded Church-Turing thesis and computational tractability of closed systems.
CoRR, 2019

Computability on Quasi-Polish Spaces.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
Non computable Mandelbrot-like sets for a one-parameter complex family.
Inf. Comput., 2018

2017
On the Information Carried by Programs About the Objects they Compute.
Theory Comput. Syst., 2017

Computing geometric Lorenz attractors with arbitrary precision.
CoRR, 2017

2015
Tight space-noise tradeoffs in computing the ergodic measure.
CoRR, 2015

2014
Probability, statistics and computation in dynamical systems.
Math. Struct. Comput. Sci., 2014

2012
Computability of the Radon-Nikodym Derivative.
Comput., 2012

Noise vs computational intractability in dynamics.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Randomness on Computable Probability Spaces - A Dynamical Point of View.
Theory Comput. Syst., 2011

Coding discretizations of continuous functions.
Discret. Math., 2011

Algorithmic tests and randomness with respect to a class of measures
CoRR, 2011

Dynamical systems, simulation, abstract computation
CoRR, 2011

2010
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy.
Inf. Comput., 2010

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties.
Theor. Comput. Sci., 2009

Computability of probability measures and Martin-Löf randomness over metric spaces.
Inf. Comput., 2009

Applications of Effective Probability Theory to Martin-Löf Randomness.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

An Application of Martin-Löf Randomness to Effective Probability Theory.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Computability and information in models of randomness and chaos.
Math. Struct. Comput. Sci., 2008

Algorithmically random points in measure preserving systems, statistical behaviour, complexity and entropy
CoRR, 2008

2007
An effective Borel-Cantelli Lemma. Constructing orbits with required statistical properties
CoRR, 2007


  Loading...