Christopher P. Porter

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 28

Top Topics

Pseudo Random Number

Kolmogorov Complexity

Probability Values

Top Venues

Bull. Symb. Log.

Notre Dame J. Formal Log.

ACM Trans. Comput. Log.

Publications

Laurent Bienvenu, Christopher P. Porter
Bridging Computational Notions of Depth. CoRR (2024)
Christopher P. Porter
Length Functions and the Dimension of Points in Self-Similar Fractal Trees. CoRR (2024)
Douglas Cenzer, Cameron Fraize, Christopher P. Porter
Extraction Rates of Random Continuous Functionals. UCNC (2023)
Christopher P. Porter
Continuous randomness via transformations of 2-random sequences. Inf. Comput. 292 (2023)
Douglas Cenzer, Christopher P. Porter
Randomness extraction in computability theory. Comput. 12 (1) (2023)
Christopher P. Porter
Length Functions and the Dimension of Points in Self-Similar Fractal Trees. IEEE Trans. Inf. Theory 69 (10) (2023)
Rupert Hölzl, Christopher P. Porter
Degrees of Randomized Computability. Bull. Symb. Log. 28 (1) (2022)
Adam Case, Christopher P. Porter
The Intersection of Algorithmically Random Closed Sets and Effective Dimension. ACM Trans. Comput. Log. 23 (4) (2022)
Christopher P. Porter
Revisiting Chaitin's Incompleteness Theorem. Notre Dame J. Formal Log. 62 (1) (2021)
Adam Case, Christopher P. Porter
The intersection of algorithmically random closed sets and effective dimension. CoRR (2021)
Christopher P. Porter
Effective aspects of Bernoulli randomness. J. Log. Comput. 29 (6) (2019)
Rupert Hölzl, Christopher P. Porter
Degrees of Randomized Computability. CoRR (2019)
Rupert Hölzl, Christopher P. Porter
Rank and Randomness. J. Symb. Log. 84 (4) (2019)
Laurent Bienvenu, Christopher P. Porter
On the Interplay between Effective Notions of Randomness and Genericity. J. Symb. Log. 84 (1) (2019)
Douglas Cenzer, Christopher P. Porter
Class. Theory Comput. Syst. 62 (7) (2018)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. 18 (3) (2017)
Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer
Randomness and Semimeasures. Notre Dame J. Formal Log. 58 (3) (2017)
Rupert Hölzl, Christopher P. Porter
Randomness for computable measures and initial segment complexity. Ann. Pure Appl. Log. 168 (4) (2017)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673 (2017)
Christopher P. Porter
On Analogues of the Church-Turing Thesis in Algorithmic Randomness. Rev. Symb. Log. 9 (3) (2016)
Laurent Bienvenu, Christopher P. Porter
Classes. Bull. Symb. Log. 22 (2) (2016)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
The probability of a computable output from a random oracle. CoRR (2016)
George Barmpalias, Douglas A. Cenzer, Christopher P. Porter
Random numbers as probabilities of machine behaviour. CoRR (2016)
Cameron Fraize, Christopher P. Porter
Kolmogorov complexity and generalized length functions. CoRR (2016)
Douglas Cenzer, Christopher P. Porter
Algorithmically Random Functions and Effective Capacities. TAMC (2015)
Quinn Culver, Christopher P. Porter
The interplay of classes of algorithmically random objects. J. Log. Anal. 7 (2015)
Christopher P. Porter
Trivial Measures are not so Trivial. Theory Comput. Syst. 56 (3) (2015)
Antonín Kucera, André Nies, Christopher P. Porter
Demuth's Path to Randomness. Bull. Symb. Log. 21 (3) (2015)
Christopher P. Porter
Kolmogorov on the role of randomness in probability theory. Math. Struct. Comput. Sci. 24 (3) (2014)
Laurent Bienvenu, Christopher P. Porter
Strong reductions in effective randomness. Theor. Comput. Sci. 459 (2012)