| Publication | Date of Publication | Type |
|---|
Bridging computational notions of depth
Information and Computation | 2026-03-20 | Paper |
Length functions and the dimension of points in self-similar fractal trees
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Extraction rates of random continuous functionals
Unconventional Computation and Natural Computation | 2024-01-12 | Paper |
Continuous randomness via transformations of 2-random sequences
Information and Computation | 2023-05-19 | Paper |
Randomness extraction in computability theory
Computability | 2023-03-09 | Paper |
The Intersection of Algorithmically Random Closed Sets and Effective Dimension
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
The equivalence of definitions of algorithmic randomness
Philosophia Mathematica | 2022-04-04 | Paper |
Degrees of randomized computability
The Bulletin of Symbolic Logic | 2022-04-04 | Paper |
| Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic | 2021-10-10 | Paper |
Revisiting Chaitin's incompleteness theorem
Notre Dame Journal of Formal Logic | 2021-09-07 | Paper |
| Key developments in algorithmic randomness | 2020-04-06 | Paper |
| Set theory and foundations of mathematics. An introduction to mathematical logic. Volume I. Set theory | 2020-04-02 | Paper |
Effective aspects of Bernoulli randomness
Journal Of Logic And Computation | 2020-01-29 | Paper |
Rank and randomness
Journal of Symbolic Logic | 2020-01-10 | Paper |
Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability
Historia Mathematica | 2019-05-16 | Paper |
On the interplay between effective notions of randomness and genericity
Journal of Symbolic Logic | 2019-03-15 | Paper |
The random members of a \({\Pi }_{1}^{0}\) class
Theory of Computing Systems | 2018-10-05 | Paper |
The probability of a computable output from a random oracle
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Randomness and semimeasures
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
Randomness and semimeasures
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
Randomness and semimeasures
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
On analogues of the Church-Turing thesis in algorithmic randomness
The Review of Symbolic Logic | 2017-05-31 | Paper |
Deep \(\Pi_1^0\) classes
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
Random numbers as probabilities of machine behavior
Theoretical Computer Science | 2017-05-02 | Paper |
Randomness for computable measures and initial segment complexity
Annals of Pure and Applied Logic | 2017-02-08 | Paper |
| Kolmogorov complexity and generalized length functions | 2016-11-17 | Paper |
Kolmogorov on the role of randomness in probability theory
Mathematical Structures in Computer Science | 2016-07-26 | Paper |
Demuth's path to randomness
The Bulletin of Symbolic Logic | 2016-03-21 | Paper |
The interplay of classes of algorithmically random objects
Journal of Logic and Analysis | 2016-02-04 | Paper |
Algorithmically Random Functions and Effective Capacities
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Trivial measures are not so trivial
Theory of Computing Systems | 2015-07-20 | Paper |
Strong reductions in effective randomness
Theoretical Computer Science | 2012-11-08 | Paper |
| Effective randomness, strong reductions and Demuth's theorem | 2011-10-09 | Paper |
Length Functions and the Dimension of Points in Self-Similar Fractal Trees
(available as arXiv preprint) | N/A | Paper |
Bridging Computational Notions of Depth
(available as arXiv preprint) | N/A | Paper |
Continuous Randomness via Transformations of 2-Random Sequences
(available as arXiv preprint) | N/A | Paper |
