George Barmpalias

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 39

Top Topics

Probability Distribution

Monotonicity Property

Top Venues

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Publications

George Barmpalias, Xiaoyan Zhang
Dimensionality and randomness. CoRR (2024)
George Barmpalias, Wei Wang
Pathwise-randomness and models of second-order arithmetic. Inf. Comput. 299 (2024)
George Barmpalias, Xiaoyan Zhang
Growth and irreducibility in path-incompressible trees. Inf. Comput. 297 (2024)
George Barmpalias, Xiaoyan Zhang
Computable one-way functions on the reals. CoRR (2024)
George Barmpalias, Xiaoyan Zhang, Bohua Zhan
Compression of enumerations and gain. CoRR (2023)
George Barmpalias, Wei Wang
Randomness below complete theories of arithmetic. Inf. Comput. 290 (2023)
George Barmpalias, Alexander Shen
The Kučera-Gács theorem revisited by Levin. Theor. Comput. Sci. 947 (2023)
George Barmpalias, Wei Wang
Growth and irreducibility in path-incompressible trees. CoRR (2022)
George Barmpalias, Lu Liu
Aspects of Muchnik's paradox in restricted betting. CoRR (2022)
George Barmpalias, Nan Fang, Andrew Lewis-Pye
Monotonous betting strategies in warped casinos. Inf. Comput. 271 (2020)
George Barmpalias, Nan Fang
Granularity of wagers in games and the possibility of saving. Inf. Comput. 275 (2020)
George Barmpalias, Andrew Lewis-Pye
Compression of Data Streams Down to Their Information Content. IEEE Trans. Inf. Theory 65 (7) (2019)
George Barmpalias, Andrew Lewis-Pye
Optimal redundancy in computations from random oracles. J. Comput. Syst. Sci. 92 (2018)
George Barmpalias, Nan Fang
Granularity of wagers in games and the (im)possibility of savings. CoRR (2018)
George Barmpalias, Andrew Lewis-Pye, Angsheng Li
Pointed computations and Martin-Löf randomness. Comput. 7 (2-3) (2018)
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 (2018)
George Barmpalias, Nan Fang, Frank Stephan
Equivalences between learning of data and probability distributions, and their applications. Inf. Comput. 262 (2018)
George Barmpalias, Nan Fang, Andrew Lewis-Pye
Monotonous betting strategies in warped casinos. CoRR (2018)
George Barmpalias, Nan Fang, Frank Stephan
Equivalences between learning of data and probability distributions, and their applications. CoRR (2018)
George Barmpalias, Andrew Lewis-Pye
Computing halting probabilities from other halting probabilities. Theor. Comput. Sci. 660 (2017)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
The Probability of a Computable Output from a Random Oracle. ACM Trans. Comput. Log. 18 (3) (2017)
George Barmpalias, Andrew Lewis-Pye
Compression of data streams down to their information content. CoRR (2017)
George Barmpalias
Aspects of Chaitin's Omega. CoRR (2017)
George Barmpalias, Andrew Lewis-Pye
A Note on the Differences of Computably Enumerable Reals. Computability and Complexity (2017)
George Barmpalias, Frank Stephan
Algorithmic learning of probability distributions from random data in the limit. CoRR (2017)
George Barmpalias, Andrew Lewis-Pye
Differences of halting probabilities. J. Comput. Syst. Sci. 89 (2017)
George Barmpalias, Rodney G. Downey
Kobayashi compressibility. Theor. Comput. Sci. 675 (2017)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
Random numbers as probabilities of machine behavior. Theor. Comput. Sci. 673 (2017)
George Barmpalias, Andrew Lewis-Pye, Nan Fang
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye
Computing halting probabilities from other halting probabilities. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye
Optimal redundancy in computations from random oracles. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye
Differences of halting probabilities. CoRR (2016)
George Barmpalias, Rodney G. Downey
Kobayashi compressibility. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye, Jason Teutsch
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. Inf. Comput. 251 (2016)
George Barmpalias, Douglas Cenzer, Christopher P. Porter
The probability of a computable output from a random oracle. CoRR (2016)
George Barmpalias, Nan Fang, Andrew Lewis-Pye
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega. J. Comput. Syst. Sci. 82 (8) (2016)
George Barmpalias, Douglas A. Cenzer, Christopher P. Porter
Random numbers as probabilities of machine behaviour. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye, Jason Teutsch
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. CoRR (2016)
George Barmpalias, Andrew Lewis-Pye, Angsheng Li
Pointed computations and Martin-Löf randomness. CoRR (2016)
George Barmpalias, Rodney G. Downey, Michael McInerney
Integer Valued Betting strategies and Turing Degrees. CoRR (2015)
George Barmpalias, Rodney G. Downey, Michael McInerney
Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. 81 (7) (2015)
George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman
On the existence of a strong minimal pair. J. Math. Log. 15 (1) (2015)
George Barmpalias, Richard Elwes, Andy Lewis-Pye
Minority population in the one-dimensional Schelling model of segregation. CoRR (2015)
George Barmpalias, Richard Elwes, Andy Lewis-Pye
From randomness to order: unperturbed Schelling segregation in two or three dimensions. CoRR (2015)
George Barmpalias, Richard Elwes, Andy Lewis-Pye
Digital Morphogenesis via Schelling Segregation. FOCS (2014)
George Barmpalias, Rodney G. Downey
-Trivial Sequences in the Turing Degrees. J. Symb. Log. 79 (3) (2014)
George Barmpalias, Manindra Agrawal, S. Barry Cooper
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560 (2014)
George Barmpalias
Universal computably enumerable sets and initial segment prefix-free complexity. Inf. Comput. 233 (2013)
Andy Lewis-Pye, George Barmpalias, Richard Elwes
Digital morphogenesis via Schelling segregation CoRR (2013)
George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113 (5-6) (2013)
Martijn Baartse, George Barmpalias
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity. Theory Comput. Syst. 52 (1) (2013)
George Barmpalias, Angsheng Li
Kolmogorov complexity and computably enumerable sets. Ann. Pure Appl. Log. 164 (12) (2013)
George Barmpalias, Richard Elwes, Andy Lewis-Pye
Tipping Points in Schelling Segregation. CoRR (2013)
George Barmpalias
Algorithmic randomness and measures of complexity. Bull. Symb. Log. 19 (3) (2013)
George Barmpalias, André Nies
Low upper bounds in the Turing degrees revisited. J. Log. Comput. 22 (4) (2012)
George Barmpalias
Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. 22 (4) (2012)
George Barmpalias
Tracing and domination in the Turing degrees. Ann. Pure Appl. Log. 163 (5) (2012)
George Barmpalias
On Strings with Trivial Kolmogorov Complexity. Int. J. Softw. Informatics 5 (4) (2011)
George Barmpalias
Universal computably enumerable sets and initial segment prefix-free complexity CoRR (2011)
George Barmpalias, André Nies
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162 (6) (2011)
George Barmpalias, Angsheng Li
Kolmogorov complexity and computably enumerable sets CoRR (2011)
George Barmpalias, Tom F. Sterkenburg
On the number of infinite sequences with trivial initial segment complexity. Theor. Comput. Sci. 412 (52) (2011)
George Barmpalias, C. S. Vlek
Kolmogorov complexity of initial segments of sequences and arithmetical definability. Theor. Comput. Sci. 412 (41) (2011)
George Barmpalias, Rod Downey, Keng Meng Ng
Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76 (2) (2011)
George Barmpalias
Elementary differences between the degrees of unsolvability and degrees of compressibility. Ann. Pure Appl. Log. 161 (7) (2010)
George Barmpalias
Relative Randomness and Cardinality. Notre Dame J. Formal Log. 51 (2) (2010)
George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng
classes in effective randomness. J. Symb. Log. 75 (1) (2010)
George Barmpalias, Anthony Morphett
Non-cupping, measure and computably enumerable splittings. Math. Struct. Comput. Sci. 19 (1) (2009)
George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
-Triviality of Closed Sets and Continuous Functions. J. Log. Comput. 19 (1) (2009)
George Barmpalias, Paul Brodhead, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
Algorithmic randomness of continuous functions. Arch. Math. Log. 46 (7-8) (2008)
George Barmpalias, Andrew E. M. Lewis, Frank Stephan
classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156 (1) (2008)
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
Randomness, lowness and degrees. J. Symb. Log. 73 (2) (2008)
Bahareh Afshari, George Barmpalias, S. Barry Cooper, Frank Stephan
Post's Programme for the Ershov Hierarchy. J. Log. Comput. 17 (6) (2007)
George Barmpalias, Antonio Montalbán
A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Electron. Notes Theor. Comput. Sci. 167 (2007)
George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
Degrees. TAMC (2007)
George Barmpalias, Paul Brodhead, Douglas Cenzer, Seyyed Dashti, Rebecca Weber
Algorithmic Randomness of Closed Sets. J. Log. Comput. 17 (6) (2007)
Andrew E. M. Lewis, George Barmpalias
Randomness and the linear degrees of computability. Ann. Pure Appl. Log. 145 (3) (2007)
George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
-Trivial Closed Sets and Continuous Functions. CiE (2007)
George Barmpalias, Andrew E. M. Lewis
A C.E. Real That Cannot Be SW-Computed by Any Ω Number. Notre Dame J. Formal Log. 47 (2) (2006)
Bahareh Afshari, George Barmpalias, S. Barry Cooper
-C.E. Hierarchy. TAMC (2006)
Andrew E. M. Lewis, George Barmpalias
Random reals and Lipschitz continuity. Math. Struct. Comput. Sci. 16 (5) (2006)
George Barmpalias, Andrew E. M. Lewis
The ibT degrees of computably enumerable sets are not dense. Ann. Pure Appl. Log. 141 (1-2) (2006)
George Barmpalias, Andrew E. M. Lewis
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame J. Formal Log. 47 (3) (2006)
George Barmpalias
Random non-cupping revisited. J. Complex. 22 (6) (2006)
George Barmpalias
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. CiE (2005)
Xizhong Zheng, Robert Rettinger, George Barmpalias
-monotonically computable real numbers. Math. Log. Q. 51 (2) (2005)
George Barmpalias
Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Log. 44 (8) (2005)
George Barmpalias
Reals. Arch. Math. Log. 43 (8) (2004)
George Barmpalias
Approximation representations for reals and their wtt-degrees. Math. Log. Q. 50 (4-5) (2004)
Xizhong Zheng, George Barmpalias
On the Monotonic Computability of Semi-computable Real Numbers. DMTCS (2003)
George Barmpalias
A transfinite hierarchy of reals. Math. Log. Q. 49 (2) (2003)
George Barmpalias
The approximation structure of a computably approximable real. J. Symb. Log. 68 (3) (2003)
George Barmpalias
On 0'-computable Reals. Electron. Notes Theor. Comput. Sci. 66 (1) (2002)