Christopher P. Porter

32 papers C 1Journal 30Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bridging computational notions of depth.
Inf. Comput.
Laurent Bienvenu, Christopher P. Porter
2025 J jnl
Extraction rates of algorithmically random continuous functionals.
Nat. Comput.
Douglas Cenzer, Cameron Fraize, Christopher P. Porter
2024 J jnl
Bridging Computational Notions of Depth.
CoRR
Laurent Bienvenu, Christopher P. Porter
2024 J jnl
Length Functions and the Dimension of Points in Self-Similar Fractal Trees.
CoRR
Christopher P. Porter
2023 J jnl
Continuous randomness via transformations of 2-random sequences.
Inf. Comput.
Christopher P. Porter
2023 — conf
Extraction Rates of Random Continuous Functionals.
UCNC
Douglas Cenzer, Cameron Fraize, Christopher P. Porter
2023 J jnl
Length Functions and the Dimension of Points in Self-Similar Fractal Trees.
IEEE Trans. Inf. Theory
Christopher P. Porter
2023 J jnl
Randomness extraction in computability theory.
Comput.
Douglas Cenzer, Christopher P. Porter
2022 J jnl
Degrees of Randomized Computability.
Bull. Symb. Log.
Rupert Hölzl, Christopher P. Porter
2022 J jnl
The Intersection of Algorithmically Random Closed Sets and Effective Dimension.
ACM Trans. Comput. Log.
Adam Case, Christopher P. Porter
2021 J jnl
Revisiting Chaitin's Incompleteness Theorem.
Notre Dame J. Formal Log.
Christopher P. Porter
2021 J jnl
The intersection of algorithmically random closed sets and effective dimension.
CoRR
Adam Case, Christopher P. Porter
2019 J jnl
Degrees of Randomized Computability.
CoRR
Rupert Hölzl, Christopher P. Porter
2019 J jnl
Effective aspects of Bernoulli randomness.
J. Log. Comput.
Christopher P. Porter
2019 J jnl
On the Interplay between Effective Notions of Randomness and Genericity.
J. Symb. Log.
Laurent Bienvenu, Christopher P. Porter
2019 J jnl
Rank and Randomness.
J. Symb. Log.
Rupert Hölzl, Christopher P. Porter
2018 J jnl
The Random Members of a Π
Theory Comput. Syst.
Douglas Cenzer, Christopher P. Porter
2017 J jnl
Random numbers as probabilities of machine behavior.
Theor. Comput. Sci.
George Barmpalias, Douglas Cenzer, Christopher P. Porter
2017 J jnl
Randomness and Semimeasures.
Notre Dame J. Formal Log.
Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer
2017 J jnl
Randomness for computable measures and initial segment complexity.
Ann. Pure Appl. Log.
Rupert Hölzl, Christopher P. Porter
2017 J jnl
The Probability of a Computable Output from a Random Oracle.
ACM Trans. Comput. Log.
George Barmpalias, Douglas Cenzer, Christopher P. Porter
2016 J jnl
Deep Pi
Bull. Symb. Log.
Laurent Bienvenu, Christopher P. Porter
2016 J jnl
Kolmogorov complexity and generalized length functions.
CoRR
Cameron Fraize, Christopher P. Porter
2016 J jnl
On Analogues of the Church-Turing Thesis in Algorithmic Randomness.
Rev. Symb. Log.
Christopher P. Porter
2016 J jnl
Random numbers as probabilities of machine behaviour.
CoRR
George Barmpalias, Douglas A. Cenzer, Christopher P. Porter
2016 J jnl
The probability of a computable output from a random oracle.
CoRR
George Barmpalias, Douglas Cenzer, Christopher P. Porter
2015 C conf
Algorithmically Random Functions and Effective Capacities.
TAMC
Douglas Cenzer, Christopher P. Porter
2015 J jnl
Demuth's Path to Randomness.
Bull. Symb. Log.
Antonín Kucera, André Nies, Christopher P. Porter
2015 J jnl
The interplay of classes of algorithmically random objects.
J. Log. Anal.
Quinn Culver, Christopher P. Porter
2015 J jnl
Trivial Measures are not so Trivial.
Theory Comput. Syst.
Christopher P. Porter
2014 J jnl
Kolmogorov on the role of randomness in probability theory.
Math. Struct. Comput. Sci.
Christopher P. Porter
2012 J jnl
Strong reductions in effective randomness.
Theor. Comput. Sci.
Laurent Bienvenu, Christopher P. Porter