George Barmpalias

Orcid: 0000-0002-9921-760X

According to our database1, George Barmpalias authored at least 76 papers between 2002 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Growth and irreducibility in path-incompressible trees.
Inf. Comput., 2024

Pathwise-randomness and models of second-order arithmetic.
Inf. Comput., 2024

The Kučera-Gács theorem revisited by Levin.
Theor. Comput. Sci., February, 2023

Randomness below complete theories of arithmetic.
Inf. Comput., January, 2023

Compression of enumerations and gain.
CoRR, 2023

Growth and irreducibility in path-incompressible trees.
CoRR, 2022

Aspects of Muchnik's paradox in restricted betting.
CoRR, 2022

Monotonous betting strategies in warped casinos.
Inf. Comput., 2020

Granularity of wagers in games and the possibility of saving.
Inf. Comput., 2020

Compression of Data Streams Down to Their Information Content.
IEEE Trans. Inf. Theory, 2019

Optimal redundancy in computations from random oracles.
J. Comput. Syst. Sci., 2018

Equivalences between learning of data and probability distributions, and their applications.
Inf. Comput., 2018

Granularity of wagers in games and the (im)possibility of savings.
CoRR, 2018

The idemetric property: when most distances are (almost) the same.
CoRR, 2018

Pointed computations and Martin-Löf randomness.
Comput., 2018

The Probability of a Computable Output from a Random Oracle.
ACM Trans. Comput. Log., 2017

Computing halting probabilities from other halting probabilities.
Theor. Comput. Sci., 2017

Kobayashi compressibility.
Theor. Comput. Sci., 2017

Random numbers as probabilities of machine behavior.
Theor. Comput. Sci., 2017

Differences of halting probabilities.
J. Comput. Syst. Sci., 2017

Algorithmic learning of probability distributions from random data in the limit.
CoRR, 2017

Aspects of Chaitin's Omega.
CoRR, 2017

A Note on the Differences of Computably Enumerable Reals.
Proceedings of the Computability and Complexity, 2017

Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega.
J. Comput. Syst. Sci., 2016

Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers.
Inf. Comput., 2016

Random numbers as probabilities of machine behaviour.
CoRR, 2016

On the existence of a strong minimal pair.
J. Math. Log., 2015

Integer valued betting strategies and Turing degrees.
J. Comput. Syst. Sci., 2015

Minority population in the one-dimensional Schelling model of segregation.
CoRR, 2015

From randomness to order: unperturbed Schelling segregation in two or three dimensions.
CoRR, 2015

Theory and Applications of Models of Computation at the Turing Centenary in China.
Theor. Comput. Sci., 2014

Exact Pairs for the Ideal of the <i>k</i>-Trivial Sequences in the Turing Degrees.
J. Symb. Log., 2014

Digital Morphogenesis via Schelling Segregation.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity.
Theory Comput. Syst., 2013

Analogues of Chaitin's Omega in the computably enumerable sets.
Inf. Process. Lett., 2013

Universal computably enumerable sets and initial segment prefix-free complexity.
Inf. Comput., 2013

Tipping Points in Schelling Segregation.
CoRR, 2013

Algorithmic randomness and measures of complexity.
Bull. Symb. Log., 2013

Kolmogorov complexity and computably enumerable sets.
Ann. Pure Appl. Log., 2013

Low upper bounds in the Turing degrees revisited.
J. Log. Comput., 2012

Compactness arguments with effectively closed sets for the study of relative randomness.
J. Log. Comput., 2012

Tracing and domination in the Turing degrees.
Ann. Pure Appl. Log., 2012

Kolmogorov complexity of initial segments of sequences and arithmetical definability.
Theor. Comput. Sci., 2011

On the number of infinite sequences with trivial initial segment complexity.
Theor. Comput. Sci., 2011

Jump inversions inside effectively closed sets and applications to randomness.
J. Symb. Log., 2011

On Strings with Trivial Kolmogorov Complexity.
Int. J. Softw. Informatics, 2011

Upper bounds on ideals in the computably enumerable Turing degrees.
Ann. Pure Appl. Log., 2011

Relative Randomness and Cardinality.
Notre Dame J. Formal Log., 2010

The importance of Pi<sup>0</sup><sub>1</sub> classes in effective randomness.
J. Symb. Log., 2010

Elementary differences between the degrees of unsolvability and degrees of compressibility.
Ann. Pure Appl. Log., 2010

Non-cupping, measure and computably enumerable splittings.
Math. Struct. Comput. Sci., 2009

<i>K</i>-Triviality of Closed Sets and Continuous Functions.
J. Log. Comput., 2009

Randomness, lowness and degrees.
J. Symb. Log., 2008

<i>I</i> classes, LR degrees and Turing degrees.
Ann. Pure Appl. Log., 2008

Algorithmic randomness of continuous functions.
Arch. Math. Log., 2008

Algorithmic Randomness of Closed Sets.
J. Log. Comput., 2007

Post's Programme for the Ershov Hierarchy.
J. Log. Comput., 2007

Randomness and the linear degrees of computability.
Ann. Pure Appl. Log., 2007

Working with the <i>LR</i> Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2007

<i>K</i> -Trivial Closed Sets and Continuous Functions.
Proceedings of the Computation and Logic in the Real World, 2007

The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.
Notre Dame J. Formal Log., 2006

A C.E. Real That Cannot Be SW-Computed by Any Ω Number.
Notre Dame J. Formal Log., 2006

Random reals and Lipschitz continuity.
Math. Struct. Comput. Sci., 2006

Random non-cupping revisited.
J. Complex., 2006

A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

The ibT degrees of computably enumerable sets are not dense.
Ann. Pure Appl. Log., 2006

Immunity Properties and the <i>n</i>-C.E. Hierarchy.
Proceedings of the Theory and Applications of Models of Computation, 2006

<i>h</i>-monotonically computable real numbers.
Math. Log. Q., 2005

Hypersimplicity and semicomputability in the weak truth table degrees.
Arch. Math. Log., 2005

Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.
Proceedings of the New Computational Paradigms, 2005

Approximation representations for reals and their wtt-degrees.
Math. Log. Q., 2004

Approximation Representations for ?<sub>2</sub> Reals.
Arch. Math. Log., 2004

A transfinite hierarchy of reals.
Math. Log. Q., 2003

The approximation structure of a computably approximable real.
J. Symb. Log., 2003

On the Monotonic Computability of Semi-computable Real Numbers.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On 0'-computable Reals.
Proceedings of the Computability and Complexity in Analysis, 2002