Available identifiers
zbMath Open porter.christopher-p MaRDI QID Q508834
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv . We are working on additional sources - please check back here soon!
Publication Date of Publication Type Length functions and the dimension of points in self-similar fractal trees 2024-07-19 Paper 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. Volume I. Set theory 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 \(\Pi_1^0\) 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 Length Functions and the Dimension of Points in Self-Similar Fractal Trees N/A Paper Bridging Computational Notions of Depth N/A Paper Continuous Randomness via Transformations of 2-Random Sequences N/A Paper
Research outcomes over time
This page was built for person: Christopher P. Porter
