Christopher P. Porter

Orcid: 0000-0002-4350-8555

According to our database1, Christopher P. Porter authored at least 26 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bridging Computational Notions of Depth.
CoRR, 2024

2023
Length Functions and the Dimension of Points in Self-Similar Fractal Trees.
IEEE Trans. Inf. Theory, October, 2023

Continuous randomness via transformations of 2-random sequences.
Inf. Comput., June, 2023

Randomness extraction in computability theory.
Comput., 2023

Extraction Rates of Random Continuous Functionals.
Proceedings of the Unconventional Computation and Natural Computation, 2023

2022
The Intersection of Algorithmically Random Closed Sets and Effective Dimension.
ACM Trans. Comput. Log., 2022

Degrees of Randomized Computability.
Bull. Symb. Log., 2022

2021
Revisiting Chaitin's Incompleteness Theorem.
Notre Dame J. Formal Log., 2021

2019
Effective aspects of Bernoulli randomness.
J. Log. Comput., 2019

Rank and Randomness.
J. Symb. Log., 2019

On the Interplay between Effective Notions of Randomness and Genericity.
J. Symb. Log., 2019

2018
The Random Members of a Π<sub>1</sub><sup>0</sup> Class.
Theory Comput. Syst., 2018

2017
The Probability of a Computable Output from a Random Oracle.
ACM Trans. Comput. Log., 2017

Random numbers as probabilities of machine behavior.
Theor. Comput. Sci., 2017

Randomness and Semimeasures.
Notre Dame J. Formal Log., 2017

Randomness for computable measures and initial segment complexity.
Ann. Pure Appl. Log., 2017

2016
On Analogues of the Church-Turing Thesis in Algorithmic Randomness.
Rev. Symb. Log., 2016

Kolmogorov complexity and generalized length functions.
CoRR, 2016

Random numbers as probabilities of machine behaviour.
CoRR, 2016

Deep Pi<sub>1</sub><sup>0</sup> Classes.
Bull. Symb. Log., 2016

2015
Trivial Measures are not so Trivial.
Theory Comput. Syst., 2015

The interplay of classes of algorithmically random objects.
J. Log. Anal., 2015

Demuth's Path to Randomness.
Bull. Symb. Log., 2015

Algorithmically Random Functions and Effective Capacities.
Proceedings of the Theory and Applications of Models of Computation, 2015

2014
Kolmogorov on the role of randomness in probability theory.
Math. Struct. Comput. Sci., 2014

2012
Strong reductions in effective randomness.
Theor. Comput. Sci., 2012


  Loading...