default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher P. Porter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Christopher P. Porter:
Length Functions and the Dimension of Points in Self-Similar Fractal Trees. CoRR abs/2403.04043 (2024)- [i6]Laurent Bienvenu, Christopher P. Porter:
Bridging Computational Notions of Depth. CoRR abs/2403.04045 (2024) - 2023
- [j21]Douglas Cenzer, Christopher P. Porter:
Randomness extraction in computability theory. Comput. 12(1): 1-21 (2023) - [j20]Christopher P. Porter
:
Continuous randomness via transformations of 2-random sequences. Inf. Comput. 292: 105028 (2023) - [j19]Christopher P. Porter:
Length Functions and the Dimension of Points in Self-Similar Fractal Trees. IEEE Trans. Inf. Theory 69(10): 6221-6230 (2023) - [c2]Douglas Cenzer, Cameron Fraize, Christopher P. Porter:
Extraction Rates of Random Continuous Functionals. UCNC 2023: 46-63 - 2022
- [j18]Rupert Hölzl, Christopher P. Porter:
Degrees of Randomized Computability. Bull. Symb. Log. 28(1): 27-70 (2022) - [j17]Adam Case, Christopher P. Porter:
The Intersection of Algorithmically Random Closed Sets and Effective Dimension. ACM Trans. Comput. Log. 23(4): 24:1-24:19 (2022) - 2021
- [j16]Christopher P. Porter:
Revisiting Chaitin's Incompleteness Theorem. Notre Dame J. Formal Log. 62(1) (2021) - [i5]Adam Case, Christopher P. Porter:
The intersection of algorithmically random closed sets and effective dimension. CoRR abs/2103.03965 (2021)
2010 – 2019
- 2019
- [j15]Laurent Bienvenu, Christopher P. Porter:
On the Interplay between Effective Notions of Randomness and Genericity. J. Symb. Log. 84(1): 393-407 (2019) - [j14]Rupert Hölzl, Christopher P. Porter:
Rank and Randomness. J. Symb. Log. 84(4): 1527-1543 (2019) - [j13]Christopher P. Porter:
Effective aspects of Bernoulli randomness. J. Log. Comput. 29(6): 933-946 (2019) - [i4]Rupert Hölzl, Christopher P. Porter:
Degrees of Randomized Computability. CoRR abs/1907.07815 (2019) - 2018
- [j12]Douglas Cenzer, Christopher P. Porter:
The Random Members of a Π10 Class. Theory Comput. Syst. 62(7): 1637-1671 (2018) - 2017
- [j11]Rupert Hölzl, Christopher P. Porter:
Randomness for computable measures and initial segment complexity. Ann. Pure Appl. Log. 168(4): 860-886 (2017) - [j10]Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer:
Randomness and Semimeasures. Notre Dame J. Formal Log. 58(3): 301-328 (2017) - [j9]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673: 1-18 (2017) - [j8]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. 18(3): 18:1-18:15 (2017) - 2016
- [j7]Laurent Bienvenu, Christopher P. Porter:
Deep Pi10 Classes. Bull. Symb. Log. 22(2): 249-286 (2016) - [j6]Christopher P. Porter:
On Analogues of the Church-Turing Thesis in Algorithmic Randomness. Rev. Symb. Log. 9(3): 456-479 (2016) - [i3]George Barmpalias, Douglas A. Cenzer, Christopher P. Porter:
Random numbers as probabilities of machine behaviour. CoRR abs/1605.05838 (2016) - [i2]Cameron Fraize, Christopher P. Porter:
Kolmogorov complexity and generalized length functions. CoRR abs/1611.05819 (2016) - [i1]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The probability of a computable output from a random oracle. CoRR abs/1612.08537 (2016) - 2015
- [j5]Antonín Kucera, André Nies, Christopher P. Porter:
Demuth's Path to Randomness. Bull. Symb. Log. 21(3): 270-305 (2015) - [j4]Quinn Culver, Christopher P. Porter:
The interplay of classes of algorithmically random objects. J. Log. Anal. 7 (2015) - [j3]Christopher P. Porter:
Trivial Measures are not so Trivial. Theory Comput. Syst. 56(3): 487-512 (2015) - [c1]Douglas Cenzer, Christopher P. Porter:
Algorithmically Random Functions and Effective Capacities. TAMC 2015: 23-37 - 2014
- [j2]Christopher P. Porter:
Kolmogorov on the role of randomness in probability theory. Math. Struct. Comput. Sci. 24(3) (2014) - 2012
- [j1]Laurent Bienvenu, Christopher P. Porter:
Strong reductions in effective randomness. Theor. Comput. Sci. 459: 55-68 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
