Christopher P. Porter

Generating author description...

All published works

Action	Title	Year	Authors
+	Bridging Computational Notions of Depth	2024	Laurent Bienvenu Christopher P. Porter
+ PDF Chat	Length Functions and the Dimension of Points in Self-Similar Fractal Trees	2024	Christopher P. Porter
+ PDF Chat	Continuous Randomness via Transformations of 2-Random Sequences	2024	Christopher P. Porter
+ PDF Chat	Extraction Rates of Algorithmically Random Continuous Functionals	2023	Douglas Cenzer Cameron Fraize Christopher P. Porter
+ PDF Chat	Length Functions and the Dimension of Points in Self-Similar Fractal Trees	2023	Christopher P. Porter
+ PDF Chat	Continuous randomness via transformations of 2-random sequences	2023	Christopher P. Porter
+	Extraction Rates of Random Continuous Functionals	2023	Douglas Cenzer Cameron Fraize Christopher P. Porter
+ PDF Chat	Randomness extraction in computability theory	2022	Douglas Cenzer Christopher P. Porter
+ PDF Chat	The Intersection of Algorithmically Random Closed Sets and Effective Dimension	2022	Adam Case Christopher P. Porter
+ PDF Chat	DEGREES OF RANDOMIZED COMPUTABILITY	2021	Rupert Hölzl Christopher P. Porter
+	Revisiting Chaitin’s Incompleteness Theorem	2021	Christopher P. Porter
+	Randomness extraction in computability theory	2021	Douglas Cenzer Christopher P. Porter
+ PDF Chat	Key developments in algorithmic randomness	2020	Johanna N. Y. Franklin Christopher P. Porter
+	Biased algorithmic randomness	2020	Christopher P. Porter
+ PDF Chat	RANK AND RANDOMNESS	2019	Rupert Hölzl Christopher P. Porter
+ PDF Chat	Effective aspects of Bernoulli randomness	2019	Christopher P. Porter
+	Degrees of Randomized Computability	2019	Rupert Hölzl Christopher P. Porter
+	Effective Aspects of Bernoulli Randomness	2019	Christopher P. Porter
+	Degrees of Randomized Computability	2019	Rupert Hölzl Christopher P. Porter
+	Three books on computability, with a special focus on Turing's legacy	2018	Christopher P. Porter
+ PDF Chat	The Probability of a Computable Output from a Random Oracle	2017	George Barmpalias Douglas Cenzer Christopher P. Porter
+ PDF Chat	Randomness and Semimeasures	2017	Laurent Bienvenu Rupert Hölzl Christopher P. Porter Paul Shafer
+	The probability of a computable output from a random oracle	2016	George Barmpalias Douglas Cenzer Christopher P. Porter
+	The random members of a $\Pi^0_1$ class	2016	Douglas Cenzer Christopher P. Porter
+ PDF Chat	Randomness for computable measures and initial segment complexity	2016	Rupert Hölzl Christopher P. Porter
+	ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS	2016	Christopher P. Porter
+	Random numbers as probabilities of machine behaviour	2016	George Barmpalias Douglas Cenzer Christopher P. Porter
+	Kolmogorov complexity and generalized length functions	2016	Cameron Fraize Christopher P. Porter
+	The random members of a $Π^0_1$ class	2016	Douglas Cenzer Christopher P. Porter
+ PDF Chat	DEMUTH’S PATH TO RANDOMNESS	2015	Antonín Kučera André Nies Christopher P. Porter
+	The interplay of classes of algorithmically random objects	2015	Quinn Culver Christopher P. Porter
+	Algorithmically random functions and effective capacities	2015	Douglas Cenzer Christopher P. Porter
+ PDF Chat	Trivial Measures are not so Trivial	2015	Christopher P. Porter
+ PDF Chat	Algorithmically Random Functions and Effective Capacities	2015	Douglas Cenzer Christopher P. Porter
+	The interplay of classes of algorithmically random objects	2015	Quinn Culver Christopher P. Porter
+	Demuth's path to randomness	2014	Antonín Kučera André Nies Christopher P. Porter
+	Kolmogorov on the role of randomness in probability theory	2014	Christopher P. Porter
+	Deep $\Pi^0_1$ Classes	2014	Laurent Bienvenu Christopher P. Porter
+	Demuth's path to randomness	2014	Antonı́n Kučera André Nies Christopher P. Porter
+	Deep $Π^0_1$ Classes	2014	Laurent Bienvenu Christopher P. Porter
+	Strong reductions in effective randomness	2012	Laurent Bienvenu Christopher P. Porter
+	Mathematical and Philosophical Perspectives on Algorithmic Randomness	2012	Christopher P. Porter
+	Effective randomness, strong reductions and Demuth's theorem	2011	Laurent Bienvenu Christopher P. Porter

Common Coauthors

Coauthor	Papers Together
Douglas Cenzer	11
Laurent Bienvenu	6
Rupert Hölzl	6
André Nies	3
Cameron Fraize	3
George Barmpalias	3
Quinn Culver	2
Antonín Kučera	2
Antonı́n Kučera	1
Paul Shafer	1
Adam Case	1
Johanna N. Y. Franklin	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Degrees of random sets	1991	Steven M. Kautz	15
+	Randomness, relativization and Turing degrees	2005	André Nies Frank Stephan Sebastiaan A. Terwijn	9
+	Kolmogorov complexity and the Recursion Theorem	2011	Bjørn Kjos-Hanssen Wolfgang Merkle Frank Stephan	8
+	The definition of random sequences	1966	Per Martin-Löf	8
+ PDF Chat	On initial segment complexity and degrees of randomness	2008	Joseph S. Miller Liang Yu	7
+	Strong reductions in effective randomness	2012	Laurent Bienvenu Christopher P. Porter	7
+	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS	1970	Alexander K. Zvonkin Leonid A. Levin	6
+	Constructive equivalence relations on computable probability measures	2009	Laurent Bienvenu Wolfgang Merkle	5
+	Coherent randomness tests and computing the $K$-trivial sets	2016	Laurent Bienvenu Noam Greenberg Antonín Kučera André Nies Dan Turetsky	5
+ PDF Chat	Π<sub>1</sub><sup>0</sup> classes with complex elements	2008	Stephen Binns	4
+	Lowness properties and randomness	2004	André Nies	4
+ PDF Chat	Algorithmic Randomness and Capacity of Closed Sets	2011	Douglas Cenzer Paul Brodhead Ferit Toska Sebastian Wyman	4
+ PDF Chat	Trivial Measures are not so Trivial	2015	Christopher P. Porter	4
+	The dimension of ergodic random sequences	2012	Mathieu Hoyrup	4
+	The typical Turing degree	2013	George Barmpalias Adam R. Day Andy Lewis-Pye	4
+	Hyperimmune-free degrees and Schnorr triviality	2008	Johanna N. Y. Franklin	4
+	RELATIVIZING CHAITIN'S HALTING PROBABILITY	2005	Rod Downey Denis R. Hirschfeldt Joseph S. Miller André Nies	4
+	A Kolmogorov complexity characterization of constructive Hausdorff dimension	2002	Elvira Mayordomo	4
+	Invariant properties of informational bulks	1977	Leonid A. Levin V. V. V jugin	4
+	On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions	2010	Vladimir V. V’yugin	4
+ PDF Chat	Randomness for non-computable measures	2013	Adam R. Day Joseph S. Miller	4
+ PDF Chat	Key developments in algorithmic randomness	2020	Johanna N. Y. Franklin Christopher P. Porter	4
+	Lowness and nullsets	2006	Rod Downey André Nies Rebecca Weber Liang Yu	4
+	Online Computability and Differentiation in the Cantor Space	2018	Douglas Cenzer Diego A. Rojas	3
+	Degrees of Unsolvability.	1965	T. G. McLaughlin Gerald E. Sacks	3
+ PDF Chat	Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension	2018	Jack H. Lutz Neil Lutz	3
+	The probability distribution as a computational resource for randomness testing	2010	Hanssen	3
+	Randomness and differentiability	2015	Vasco Brattka Joseph S. Miller André Nies	3
+	Another Example of Higher Order Randomness	2002	Verónica Becher Gregory J. Chaitin	3
+	Mathematical and Philosophical Perspectives on Algorithmic Randomness	2012	Christopher P. Porter	3
+	Algorithmically random closed sets and probability	2010	Peter Cholak Logan Axon	3
+ PDF Chat	The dimensions of individual strings and sequences	2003	Jack H. Lutz	3
+	Randomness conservation inequalities; information and independence in mathematical theories	1984	Leonid A. Levin	3
+	An Introduction to Kolmogorov Complexity and Its Applications	2019	Ming Li Paul Vitányi	3
+ PDF Chat	Computability of the ergodic decomposition	2012	Mathieu Hoyrup	3
+	Martin-Löf randomness and Galton–Watson processes	2011	David Diamondstone Bjørn Kjos-Hanssen	3
+	Randomness and Computability: Open Questions	2006	Joseph S. Miller André Nies	3
+	Propagation of partial randomness	2013	Kojiro Higuchi W. M. Phillip Hudelson Stephen G. Simpson Keita Yokoyama	3
+	A constructive version of Birkhoffʼs ergodic theorem for Martin-Löf random points	2011	Laurent Bienvenu Adam R. Day Mathieu Hoyrup Ilya Mezhirov Alexander Shen	3
+ PDF Chat	Randomness and Recursive Enumerability	2001	Antonín Kučera Theodore A. Slaman	3
+	Using random sets as oracles	2007	Denis R. Hirschfeldt André Nies Frank Stephan	3
+	Measure, Π 1 0 -classes and complete extensions of PA	1985	Antonín Kučera	3
+	Measures and their random reals	2015	Jan Reimann Theodore A. Slaman	3
+	Mathematical metaphysics of randomness	1998	Andrei A. Muchnik A. L. Semenov Vladimir Uspensky	3
+	Pi-0-1 classes in computable analysis and topology	2002	Anil Nerode Joseph S. Miller	3
+	A Highly Random Number	2001	Verónica Becher Sergio Daicz Gregory J. Chaitin	3
+ PDF Chat	An Application of Martin-Löf Randomness to Effective Probability Theory	2009	Mathieu Hoyrup Cristóbal Rojas	3
+ PDF Chat	Randomness for computable measures and initial segment complexity	2016	Rupert Hölzl Christopher P. Porter	3
+ PDF Chat	Algorithmically Random Functions and Effective Capacities	2015	Douglas Cenzer Christopher P. Porter	3
+ PDF Chat	Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma	2014	A. K. Rumyantsev Alexander Shen	2