The following pages link to Christopher P. Porter (Q508834):
Displaying 30 items.
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- (Q1758163) (redirect page) (← links)
- Strong reductions in effective randomness (Q1758164) (← links)
- The random members of a \({\Pi }_{1}^{0}\) class (Q1787954) (← links)
- Revisiting Chaitin's incompleteness theorem (Q1982000) (← links)
- Randomness and semimeasures (Q2013389) (← links)
- Trivial measures are not so trivial (Q2354580) (← links)
- 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 computabili (Q2631823) (← links)
- DEMUTH’S PATH TO RANDOMNESS (Q2795307) (← links)
- Algorithmically Random Functions and Effective Capacities (Q2948450) (← links)
- The interplay of classes of algorithmically random objects (Q3467669) (← links)
- ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY (Q4628689) (← links)
- The Intersection of Algorithmically Random Closed Sets and Effective Dimension (Q5056370) (← links)
- The Equivalence of Definitions of Algorithmic Randomness† (Q5067708) (← links)
- DEGREES OF RANDOMIZED COMPUTABILITY (Q5067871) (← links)
- Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic (Q5155888) (← links)
- RANK AND RANDOMNESS (Q5207564) (← links)
- Effective aspects of Bernoulli randomness (Q5212559) (← links)
- Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic (Q5221624) (← links)
- DEEP CLASSES (Q5346696) (← links)
- The Probability of a Computable Output from a Random Oracle (Q5369244) (← links)
- ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS (Q5737950) (← links)
- Kolmogorov on the role of randomness in probability theory (Q5740358) (← links)
- Randomness extraction in computability theory (Q5880936) (← links)
- Continuous randomness via transformations of 2-random sequences (Q6040663) (← links)
- Length Functions and the Dimension of Points in Self-Similar Fractal Trees (Q6524924) (← links)
- Bridging Computational Notions of Depth (Q6524925) (← links)
- Continuous Randomness via Transformations of 2-Random Sequences (Q6524928) (← links)
- Length functions and the dimension of points in self-similar fractal trees (Q6574959) (← links)
