George Barmpalias
According to our database^{1},
George Barmpalias
authored at least 59 papers
between 2002 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
Compression of Data Streams Down to Their Information Content.
IEEE Trans. Information Theory, 2019
2018
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
Pointed computations and MartinLöf randomness.
Computability, 2018
2017
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
A Note on the Differences of Computably Enumerable Reals.
Proceedings of the Computability and Complexity, 2017
2016
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
2015
On the existence of a strong minimal pair.
J. Mathematical Logic, 2015
Integer valued betting strategies and Turing degrees.
J. Comput. Syst. Sci., 2015
2014
Theory and Applications of Models of Computation at the Turing Centenary in China.
Theor. Comput. Sci., 2014
Exact Pairs for the Ideal of the kTrivial 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
2013
On the Gap Between Trivial and Nontrivial Initial Segment PrefixFree 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 prefixfree complexity.
Inf. Comput., 2013
Algorithmic randomness and measures of complexity.
Bulletin of Symbolic Logic, 2013
Kolmogorov complexity and computably enumerable sets.
Ann. Pure Appl. Logic, 2013
2012
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. Logic, 2012
2011
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. Software and Informatics, 2011
Upper bounds on ideals in the computably enumerable Turing degrees.
Ann. Pure Appl. Logic, 2011
2010
Relative Randomness and Cardinality.
Notre Dame Journal of Formal Logic, 2010
The importance of Pi^{0}_{1} classes in effective randomness.
J. Symb. Log., 2010
Elementary differences between the degrees of unsolvability and degrees of compressibility.
Ann. Pure Appl. Logic, 2010
2009
Noncupping, measure and computably enumerable splittings.
Mathematical Structures in Computer Science, 2009
KTriviality of Closed Sets and Continuous Functions.
J. Log. Comput., 2009
2008
Randomness, lowness and degrees.
J. Symb. Log., 2008
I classes, LR degrees and Turing degrees.
Ann. Pure Appl. Logic, 2008
Algorithmic randomness of continuous functions.
Arch. Math. Log., 2008
2007
Algorithmic Randomness of Closed Sets.
J. Log. Comput., 2007
Post's Programme for the Ershov Hierarchy.
J. Log. Comput., 2007
A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
Electr. Notes Theor. Comput. Sci., 2007
Randomness and the linear degrees of computability.
Ann. Pure Appl. Logic, 2007
Working with the LR Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2007
K Trivial Closed Sets and Continuous Functions.
Proceedings of the Computation and Logic in the Real World, 2007
2006
The HypersimpleFree C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.
Notre Dame Journal of Formal Logic, 2006
A C.E. Real That Cannot Be SWComputed by Any Ω Number.
Notre Dame Journal of Formal Logic, 2006
Random reals and Lipschitz continuity.
Mathematical Structures in Computer Science, 2006
Random noncupping revisited.
J. Complexity, 2006
The ibT degrees of computably enumerable sets are not dense.
Ann. Pure Appl. Logic, 2006
Immunity Properties and the nC.E. Hierarchy.
Proceedings of the Theory and Applications of Models of Computation, 2006
2005
hmonotonically 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
2004
Approximation representations for reals and their wttdegrees.
Math. Log. Q., 2004
Approximation Representations for ?_{2} Reals.
Arch. Math. Log., 2004
2003
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 Semicomputable Real Numbers.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
2002
On 0'computable Reals.
Electr. Notes Theor. Comput. Sci., 2002