Cristobal Rojas

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

On the algorithmic descriptive complexity of attractors in topological dynamics.

[BibT_eX]

[DOI]

Mathieu Sablik

CoRR, 2023

Three Iterations of (d - 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points.

[BibT_eX]

[DOI]

Valentino Delle Rose

Alexander Kozachinskiy

Mircea Petrache

Pablo Barceló

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Valentino Delle Rose

Alexander Kozachinskiy

Cristóbal Rojas

Tomasz Steifer

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022

Realizing semicomputable simplices by computable dynamical systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Computability in Harmonic Analysis.

[BibT_eX]

[DOI]

Found. Comput. Math., 2022

2021

Real Quadratic Julia Sets Can Have Arbitrarily High Complexity.

[BibT_eX]

[DOI]

Michael Yampolsky

Found. Comput. Math., 2021

2020

How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable.

[BibT_eX]

[DOI]

Michael Yampolsky

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

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

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Mark Braverman

Jonathan Schneider

CoRR, 2019

Computability on Quasi-Polish Spaces.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Non computable Mandelbrot-like sets for a one-parameter complex family.

[BibT_eX]

[DOI]

Daniel Coronel

Michael Yampolsky

Inf. Comput., 2018

2017

On the Information Carried by Programs About the Objects they Compute.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Computing geometric Lorenz attractors with arbitrary precision.

[BibT_eX]

[DOI]

Daniel Silva Graça

Ning Zhong

CoRR, 2017

2015

Tight space-noise tradeoffs in computing the ergodic measure.

[BibT_eX]

[DOI]

Mark Braverman

Jon Schneider

CoRR, 2015

2014

Probability, statistics and computation in dynamical systems.

[BibT_eX]

[DOI]

Isaia Nisoli

Math. Struct. Comput. Sci., 2014

2012

Computability of the Radon-Nikodym Derivative.

[BibT_eX]

[DOI]

Klaus Weihrauch

Comput., 2012

Noise vs computational intractability in dynamics.

[BibT_eX]

[DOI]

Mark Braverman

Alexander Grigo

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011

Randomness on Computable Probability Spaces - A Dynamical Point of View.

[BibT_eX]

[DOI]

Péter Gács

Theory Comput. Syst., 2011

Coding discretizations of continuous functions.

[BibT_eX]

[DOI]

Serge Troubetzkoy

Discret. Math., 2011

Algorithmic tests and randomness with respect to a class of measures

[BibT_eX]

[DOI]

CoRR, 2011

Dynamical systems, simulation, abstract computation

[BibT_eX]

[DOI]

CoRR, 2011

2010

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

[BibT_eX]

[DOI]

Inf. Comput., 2010

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Computability of probability measures and Martin-Löf randomness over metric spaces.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Applications of Effective Probability Theory to Martin-Löf Randomness.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

An Application of Martin-Löf Randomness to Effective Probability Theory.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Computability and information in models of randomness and chaos.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

2007

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

[BibT_eX]

[DOI]