Available identifiers
zbMath Open porter.christopher-pMaRDI QIDQ508834
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Extraction rates of random continuous functionals | 2024-01-12 | Paper |
| Continuous randomness via transformations of 2-random sequences | 2023-05-19 | Paper |
| Randomness extraction in computability theory | 2023-03-09 | Paper |
| The Intersection of Algorithmically Random Closed Sets and Effective Dimension | 2022-12-08 | Paper |
| The Equivalence of Definitions of Algorithmic Randomness† | 2022-04-04 | Paper |
| DEGREES OF RANDOMIZED COMPUTABILITY | 2022-04-04 | Paper |
| Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic | 2021-10-10 | Paper |
| Revisiting Chaitin's incompleteness theorem | 2021-09-07 | Paper |
| Key developments in algorithmic randomness | 2020-04-06 | Paper |
| Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic | 2020-04-02 | Paper |
| Effective aspects of Bernoulli randomness | 2020-01-29 | Paper |
| RANK AND RANDOMNESS | 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 | 2019-05-16 | Paper |
| ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY | 2019-03-15 | Paper |
| The random members of a \({\Pi }_{1}^{0}\) class | 2018-10-05 | Paper |
| The Probability of a Computable Output from a Random Oracle | 2017-10-16 | Paper |
| Randomness and semimeasures | 2017-08-17 | Paper |
| ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS | 2017-05-31 | Paper |
| DEEP CLASSES | 2017-05-26 | Paper |
| Random numbers as probabilities of machine behavior | 2017-05-02 | Paper |
| Randomness for computable measures and initial segment complexity | 2017-02-08 | Paper |
| Kolmogorov complexity and generalized length functions | 2016-11-17 | Paper |
| Kolmogorov on the role of randomness in probability theory | 2016-07-26 | Paper |
| DEMUTH’S PATH TO RANDOMNESS | 2016-03-21 | Paper |
| The interplay of classes of algorithmically random objects | 2016-02-04 | Paper |
| Algorithmically Random Functions and Effective Capacities | 2015-09-30 | Paper |
| Trivial measures are not so trivial | 2015-07-20 | Paper |
| Strong reductions in effective randomness | 2012-11-08 | Paper |
| Effective randomness, strong reductions and Demuth's theorem | 2011-10-09 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Christopher P. Porter
