default search action
George Barmpalias
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j56]George Barmpalias
, Xiaoyan Zhang:
Growth and irreducibility in path-incompressible trees. Inf. Comput. 297: 105136 (2024) - [j55]George Barmpalias
Pathwise-randomness and models of second-order arithmetic. Inf. Comput. 299: 105181 (2024) - [i28]George Barmpalias, Xiaoyan Zhang:
Dimensionality and randomness. CoRR abs/2405.06961 (2024) - [i27]George Barmpalias, Xiaoyan Zhang:
Computable one-way functions on the reals. CoRR abs/2406.15817 (2024) - 2023
- [j54]George Barmpalias
Randomness below complete theories of arithmetic. Inf. Comput. 290: 104983 (2023) - [j53]George Barmpalias, Alexander Shen
The Kučera-Gács theorem revisited by Levin. Theor. Comput. Sci. 947: 113693 (2023) - [i26]George Barmpalias, Xiaoyan Zhang, Bohua Zhan:
Compression of enumerations and gain. CoRR abs/2304.03030 (2023) - 2022
- [i25]George Barmpalias, Lu Liu:
Aspects of Muchnik's paradox in restricted betting. CoRR abs/2201.07007 (2022) - [i24]George Barmpalias, Wei Wang:
Growth and irreducibility in path-incompressible trees. CoRR abs/2206.15425 (2022) - 2020
- [j52]George Barmpalias
Monotonous betting strategies in warped casinos. Inf. Comput. 271: 104480 (2020) - [j51]George Barmpalias
Granularity of wagers in games and the possibility of saving. Inf. Comput. 275: 104600 (2020)
2010 – 2019
- 2019
- [j50]George Barmpalias
Compression of Data Streams Down to Their Information Content. IEEE Trans. Inf. Theory 65(7): 4471-4485 (2019) - 2018
- [j49]George Barmpalias
Pointed computations and Martin-Löf randomness. Comput. 7(2-3): 171-177 (2018) - [j48]George Barmpalias
Equivalences between learning of data and probability distributions, and their applications. Inf. Comput. 262: 123-140 (2018) - [j47]George Barmpalias
Optimal redundancy in computations from random oracles. J. Comput. Syst. Sci. 92: 1-8 (2018) - [i23]George Barmpalias, Nan Fang, Frank Stephan:
Equivalences between learning of data and probability distributions, and their applications. CoRR abs/1801.02566 (2018) - [i22]George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden:
The idemetric property: when most distances are (almost) the same. CoRR abs/1804.11187 (2018) - [i21]George Barmpalias, Nan Fang, Andrew Lewis-Pye:
Monotonous betting strategies in warped casinos. CoRR abs/1807.04635 (2018) - [i20]George Barmpalias, Nan Fang:
Granularity of wagers in games and the (im)possibility of savings. CoRR abs/1810.05372 (2018) - 2017
- [j46]George Barmpalias
Differences of halting probabilities. J. Comput. Syst. Sci. 89: 349-360 (2017) - [j45]George Barmpalias
Computing halting probabilities from other halting probabilities. Theor. Comput. Sci. 660: 16-22 (2017) - [j44]George Barmpalias
Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673: 1-18 (2017) - [j43]George Barmpalias
Kobayashi compressibility. Theor. Comput. Sci. 675: 89-100 (2017) - [j42]George Barmpalias
The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. 18(3): 18:1-18:15 (2017) - [c9]George Barmpalias
A Note on the Differences of Computably Enumerable Reals. Computability and Complexity 2017: 623-632 - [i19]George Barmpalias:
Aspects of Chaitin's Omega. CoRR abs/1707.08109 (2017) - [i18]George Barmpalias, Andrew Lewis-Pye:
Compression of data streams down to their information content. CoRR abs/1710.02092 (2017) - [i17]George Barmpalias, Frank Stephan:
Algorithmic learning of probability distributions from random data in the limit. CoRR abs/1710.11303 (2017) - 2016
- [j41]George Barmpalias
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251: 287-300 (2016) - [j40]George Barmpalias
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. J. Comput. Syst. Sci. 82(8): 1283-1299 (2016) - [i16]George Barmpalias, Andrew Lewis-Pye, Nan Fang:
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. CoRR abs/1602.03208 (2016) - [i15]George Barmpalias, Andrew Lewis-Pye:
Computing halting probabilities from other halting probabilities. CoRR abs/1602.06395 (2016) - [i14]George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR abs/1602.07113 (2016) - [i13]George Barmpalias, Andrew Lewis-Pye:
Differences of halting probabilities. CoRR abs/1604.00216 (2016) - [i12]George Barmpalias, Douglas A. Cenzer, Christopher P. Porter:
Random numbers as probabilities of machine behaviour. CoRR abs/1605.05838 (2016) - [i11]George Barmpalias, Andrew Lewis-Pye:
Optimal redundancy in computations from random oracles. CoRR abs/1606.07910 (2016) - [i10]George Barmpalias, Rodney G. Downey:
Kobayashi compressibility. CoRR abs/1608.00692 (2016) - [i9]George Barmpalias, Andrew Lewis-Pye, Angsheng Li:
Pointed computations and Martin-Löf randomness. CoRR abs/1608.02081 (2016) - [i8]George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The probability of a computable output from a random oracle. CoRR abs/1612.08537 (2016) - 2015
- [j39]George Barmpalias
Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. 81(7): 1387-1412 (2015) - [j38]George Barmpalias
On the existence of a strong minimal pair. J. Math. Log. 15(1): 1550003:1-1550003:28 (2015) - [i7]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
From randomness to order: unperturbed Schelling segregation in two or three dimensions. CoRR abs/1504.03809 (2015) - [i6]George Barmpalias, Rodney G. Downey, Michael McInerney:
Integer Valued Betting strategies and Turing Degrees. CoRR abs/1505.05298 (2015) - [i5]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
Minority population in the one-dimensional Schelling model of segregation. CoRR abs/1508.02497 (2015) - 2014
- [j37]George Barmpalias
Exact Pairs for the Ideal of the k-Trivial Sequences in the Turing Degrees. J. Symb. Log. 79(3): 676-692 (2014) - [j36]George Barmpalias
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560: 107 (2014) - [c8]George Barmpalias
Digital Morphogenesis via Schelling Segregation. FOCS 2014: 156-165 - 2013
- [j35]George Barmpalias
Kolmogorov complexity and computably enumerable sets. Ann. Pure Appl. Log. 164(12): 1187-1200 (2013) - [j34]George Barmpalias
Algorithmic randomness and measures of complexity. Bull. Symb. Log. 19(3): 318-350 (2013) - [j33]George Barmpalias
Universal computably enumerable sets and initial segment prefix-free complexity. Inf. Comput. 233: 41-59 (2013) - [j32]George Barmpalias
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113(5-6): 171-178 (2013) - [j31]Martijn Baartse, George Barmpalias
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. 52(1): 28-47 (2013) - [i4]Andy Lewis-Pye, George Barmpalias, Richard Elwes:
Digital morphogenesis via Schelling segregation. CoRR abs/1302.4014 (2013) - [i3]George Barmpalias, Richard Elwes, Andy Lewis-Pye:
Tipping Points in Schelling Segregation. CoRR abs/1311.5934 (2013) - 2012
- [j30]George Barmpalias
Tracing and domination in the Turing degrees. Ann. Pure Appl. Log. 163(5): 500-505 (2012) - [j29]George Barmpalias
Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. 22(4): 679-691 (2012) - [j28]George Barmpalias
Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22(4): 693-699 (2012) - 2011
- [j27]George Barmpalias
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162(6): 465-473 (2011) - [j26]George Barmpalias:
On Strings with Trivial Kolmogorov Complexity. Int. J. Softw. Informatics 5(4): 579-593 (2011) - [j25]George Barmpalias
Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011) - [j24]George Barmpalias
Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412(41): 5656-5667 (2011) - [j23]George Barmpalias
On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412(52): 7133-7146 (2011) - [i2]George Barmpalias:
Universal computably enumerable sets and initial segment prefix-free complexity. CoRR abs/1110.1864 (2011) - [i1]George Barmpalias, Angsheng Li:
Kolmogorov complexity and computably enumerable sets. CoRR abs/1111.4339 (2011) - 2010
- [j22]George Barmpalias
Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Log. 161(7): 923-934 (2010) - [j21]George Barmpalias
The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010) - [j20]George Barmpalias
Relative Randomness and Cardinality. Notre Dame J. Formal Log. 51(2): 195-205 (2010)
2000 – 2009
- 2009
- [j19]George Barmpalias
K-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19(1): 3-16 (2009) - [j18]George Barmpalias
Non-cupping, measure and computably enumerable splittings. Math. Struct. Comput. Sci. 19(1): 25-43 (2009) - 2008
- [j17]George Barmpalias
Algorithmic randomness of continuous functions. Arch. Math. Log. 46(7-8): 533-546 (2008) - [j16]George Barmpalias
I classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156(1): 21-38 (2008) - [j15]George Barmpalias
Randomness, lowness and degrees. J. Symb. Log. 73(2): 559-577 (2008) - 2007
- [j14]Andrew E. M. Lewis, George Barmpalias
Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145(3): 252-257 (2007) - [j13]Bahareh Afshari
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17(6): 1025-1040 (2007) - [j12]George Barmpalias
Algorithmic Randomness of Closed Sets. J. Log. Comput. 17(6): 1041-1062 (2007) - [c7]George Barmpalias
K -Trivial Closed Sets and Continuous Functions. CiE 2007: 135-145 - [c6]George Barmpalias
Working with the LR Degrees. TAMC 2007: 89-99 - 2006
- [j11]George Barmpalias
The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 141(1-2): 51-60 (2006) - [j10]George Barmpalias
Random non-cupping revisited. J. Complex. 22(6): 850-857 (2006) - [j9]Andrew E. M. Lewis, George Barmpalias
Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. 16(5): 737-749 (2006) - [j8]George Barmpalias
A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame J. Formal Log. 47(2): 197-209 (2006) - [j7]George Barmpalias
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Log. 47(3): 361-370 (2006) - [c5]Bahareh Afshari
Immunity Properties and the n-C.E. Hierarchy. TAMC 2006: 694-703 - [c4]George Barmpalias
A Cappable Almost Everywhere Dominating Computably Enumerable Degree. CCA 2006: 17-31 - 2005
- [j6]George Barmpalias
Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44(8): 1045-1065 (2005) - [j5]Xizhong Zheng, Robert Rettinger, George Barmpalias
h-monotonically computable real numbers. Math. Log. Q. 51(2): 157-170 (2005) - [c3]George Barmpalias
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE 2005: 8-17 - 2004
- [j4]George Barmpalias
Approximation Representations for ?2 Reals. Arch. Math. Log. 43(8): 947-964 (2004) - [j3]George Barmpalias
Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50(4-5): 370-380 (2004) - 2003
- [j2]George Barmpalias
The approximation structure of a computably approximable real. J. Symb. Log. 68(3): 885-922 (2003) - [j1]George Barmpalias
A transfinite hierarchy of reals. Math. Log. Q. 49(2): 163-172 (2003) - [c2]Xizhong Zheng, George Barmpalias
On the Monotonic Computability of Semi-computable Real Numbers. DMTCS 2003: 290-300 - 2002
- [c1]George Barmpalias
On 0'-computable Reals. CCA 2002: 1-12
Coauthor Index
aka: Andrew Lewis-Pye
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 2024-12-23 19:32 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: