| Strong reductions in effective randomness L Bienvenu, C Porter Theoretical Computer Science 459, 55-68, 2012 | 33 | 2012 |
| Demuth’s path to randomness A Kučera, A Nies, CP Porter Bulletin of Symbolic Logic 21 (3), 270-305, 2015 | 19 | 2015 |
| Randomness and semimeasures L Bienvenu, R Hölzl, CP Porter, P Shafer | 14 | 2017 |
| Deep classes L Bienvenu, CP Porter Bulletin of Symbolic Logic 22 (2), 249-286, 2016 | 14 | 2016 |
| Mathematical and philosophical perspectives on algorithmic randomness CP Porter University of Notre Dame, 2012 | 11 | 2012 |
| On analogues of the Church–Turing thesis in algorithmic randomness CP Porter The Review of Symbolic Logic 9 (3), 456-479, 2016 | 8 | 2016 |
| Kolmogorov on the role of randomness in probability theory CP Porter Mathematical Structures in Computer Science 24 (3), e240302, 2014 | 7 | 2014 |
| Key developments in algorithmic randomness JNY Franklin, CP Porter Algorithmic Randomness: Progress and Prospects 50, 1-39, 2020 | 6 | 2020 |
| Randomness for computable measures and initial segment complexity R Hölzl, CP Porter Annals of Pure and Applied Logic 168 (4), 860-886, 2017 | 6 | 2017 |
| Algorithmically random functions and effective capacities D Cenzer, CP Porter International Conference on Theory and Applications of Models of Computation …, 2015 | 6 | 2015 |
| Trivial measures are not so trivial CP Porter Theory of Computing Systems 56 (3), 487-512, 2015 | 6 | 2015 |
| The interplay of classes of algorithmically random objects Q Culver, CP Porter arXiv preprint arXiv:1503.06322, 2015 | 6 | 2015 |
| Algorithmic Randomness: Progress and Prospects JNY Franklin, CP Porter Cambridge University Press, 2020 | 5 | 2020 |
| Effective aspects of Bernoulli randomness CP Porter Journal of Logic and Computation 29 (6), 933-946, 2019 | 5 | 2019 |
| Random numbers as probabilities of machine behavior G Barmpalias, D Cenzer, CP Porter Theoretical Computer Science 673, 1-18, 2017 | 5 | 2017 |
| The equivalence of definitions of algorithmic randomness C Porter Philosophia Mathematica 29 (1), 153-194, 2021 | 3 | 2021 |
| Biased algorithmic randomness CP Porter Franklin and Porter: New York, NY, USA, 206-231, 2020 | 3 | 2020 |
| Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic: Volume I: Set Theory D Cenzer, J Larson, C Porter, J Zapletal | 3 | 2020 |
| The probability of a computable output from a random oracle G Barmpalias, D Cenzer, CP Porter ACM Transactions on Computational Logic (TOCL) 18 (3), 1-15, 2017 | 3 | 2017 |
| Randomness extraction in computability theory D Cenzer, CP Porter Computability 12 (1), 1-21, 2023 | 1 | 2023 |
