5 citations · 16 across the 20 of their papers we have counts for
22 papers
A Framework for Quantum Advantage
Olivia Lanes, Mourad Beji, Antonio D. Corcoles +12
As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quant…
Continuous Randomness via Transformations of 2-Random Sequences
Christopher P. Porter
Reimann and Slaman initiated the study of sequences that are Martin-Löf random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of seq…
Length Functions and the Dimension of Points in Self-Similar Fractal Trees
Christopher P. Porter
In this paper, we study the effective dimension of points in infinite fractal trees generated recursively by a finite tree over some alphabet. Using unequal costs coding, we associ…
Randomness extraction in computability theory
Douglas Cenzer, Christopher P. Porter
In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measur…
The intersection of algorithmically random closed sets and effective dimension
Adam Case, Christopher P. Porter
In this article, we study several aspects of the intersections of algorithmically random closed sets. First, we answer a question of Cenzer and Weber, showing that the operation of…
Key developments in algorithmic randomness
Johanna N. Y. Franklin, Christopher P. Porter
The goal of this introductory survey is to present the major developments of algorithmic randomness with an eye toward its historical development. While two highly comprehensive bo…