Zobrazeno 1 - 10
of 928
pro vyhledávání: '"Porter, Christopher P."'
Autor:
Porter, Christopher P.
Publikováno v:
Information and Computation, Volume 292, June 2023
Reimann and Slaman initiated the study of sequences that are Martin-L\"of random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of sequences that are not Martin-L\"of random with respect to any continuo
Externí odkaz:
http://arxiv.org/abs/2403.04047
Autor:
Porter, Christopher P.
Publikováno v:
IEEE Transactions on Information Theory, Volume 69, Issue 10, October 2023
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 associate a length function with each such fractal tree and show that the ch
Externí odkaz:
http://arxiv.org/abs/2403.04043
In this article, we study the relationship between notions of depth for sequences, namely, Bennett's notions of strong and weak depth, and deep $\Pi^0_1$ classes, introduced by the authors and motivated by previous work of Levin. For the first main r
Externí odkaz:
http://arxiv.org/abs/2403.04045
Autor:
Sivarajan, Shankar, Shi, Yu, Xiang, Katherine M., Rodríguez-Cruz, Clary, Porter, Christopher L., Kostecki, Geran M., Tung, Leslie, Crocker, John C., Reich, Daniel H.
The actomyosin cortex is an active material that provides animal cells with a strong but flexible exterior, whose mechanics, including non-Gaussian fluctuations and occasional large displacements or cytoquakes, have defied explanation. We study the a
Externí odkaz:
http://arxiv.org/abs/2309.06226
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 measures. We analyze several classes of extraction procedures: a first class
Externí odkaz:
http://arxiv.org/abs/2103.03971
Autor:
Case, Adam, Porter, Christopher P.
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 intersecting relatively random closed sets (with respect to certain u
Externí odkaz:
http://arxiv.org/abs/2103.03965
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 books and one thorough survey article have been written on the subject,
Externí odkaz:
http://arxiv.org/abs/2004.02851
Autor:
Shields, Victoria R., Robshaw, Thomas J, Porter, Christopher P., Amphlett, James T.M., Hides, Alan, Bruce, Richard, Cordiner, Joan, Ogden, Mark D.
Publikováno v:
In Resources, Conservation & Recycling Advances November 2023 19
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.