George Barmpalias

Inf. Comput., 2026

Speedability of computably approximable reals and their approximations.

[BibT_eX]

[DOI]

Inf. Comput., 2026

2025

Complexity of inversion of functions on the reals.

[BibT_eX]

[DOI]

Mingyang Wang

Math. Struct. Comput. Sci., 2025

Computable one-way functions on the reals.

[BibT_eX]

[DOI]

Inf. Comput., 2025

2024

Growth and irreducibility in path-incompressible trees.

[BibT_eX]

[DOI]

Inf. Comput., 2024

Pathwise-randomness and models of second-order arithmetic.

[BibT_eX]

[DOI]

Wei Wang

Inf. Comput., 2024

Dimensionality and randomness.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The Kučera-Gács theorem revisited by Levin.

[BibT_eX]

[DOI]

Alexander Shen

Theor. Comput. Sci., February, 2023

Randomness below complete theories of arithmetic.

[BibT_eX]

[DOI]

Wei Wang

Inf. Comput., January, 2023

Compression of enumerations and gain.

[BibT_eX]

[DOI]

Bohua Zhan

CoRR, 2023

2022

Growth and irreducibility in path-incompressible trees.

[BibT_eX]

[DOI]

Wei Wang

CoRR, 2022

Aspects of Muchnik's paradox in restricted betting.

[BibT_eX]

[DOI]

Lu Liu

CoRR, 2022

2020

Monotonous betting strategies in warped casinos.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Granularity of wagers in games and the possibility of saving.

[BibT_eX]

[DOI]

Inf. Comput., 2020

2019

Compression of Data Streams Down to Their Information Content.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

2018

Optimal redundancy in computations from random oracles.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

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

[BibT_eX]

[DOI]

Frank Stephan

Inf. Comput., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Pointed computations and Martin-Löf randomness.

[BibT_eX]

[DOI]

Angsheng Li

Comput., 2018

2017

The Probability of a Computable Output from a Random Oracle.

[BibT_eX]

[DOI]

Douglas Cenzer

Christopher P. Porter

ACM Trans. Comput. Log., 2017

Computing halting probabilities from other halting probabilities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Kobayashi compressibility.

[BibT_eX]

[DOI]

Rodney G. Downey

Theor. Comput. Sci., 2017

Random numbers as probabilities of machine behavior.

[BibT_eX]

[DOI]

Douglas Cenzer

Christopher P. Porter

Theor. Comput. Sci., 2017

Differences of halting probabilities.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

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

[BibT_eX]

[DOI]

Frank Stephan

CoRR, 2017

Aspects of Chaitin's Omega.

[BibT_eX]

[DOI]

CoRR, 2017

A Note on the Differences of Computably Enumerable Reals.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

2016

Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

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

[BibT_eX]

[DOI]

Jason Teutsch

Inf. Comput., 2016

Random numbers as probabilities of machine behaviour.

[BibT_eX]

[DOI]

Douglas A. Cenzer

Christopher P. Porter

CoRR, 2016

2015

On the existence of a strong minimal pair.

[BibT_eX]

[DOI]

J. Math. Log., 2015

Integer valued betting strategies and Turing degrees.

[BibT_eX]

[DOI]

Rodney G. Downey

Michael McInerney

J. Comput. Syst. Sci., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

2014

Theory and Applications of Models of Computation at the Turing Centenary in China.

[BibT_eX]

[DOI]

Manindra Agrawal

S. Barry Cooper

Theor. Comput. Sci., 2014

Exact Pairs for the Ideal of the k-Trivial Sequences in the Turing Degrees.

[BibT_eX]

[DOI]

Rodney G. Downey

J. Symb. Log., 2014

Digital Morphogenesis via Schelling Segregation.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity.

[BibT_eX]

[DOI]

Martijn Baartse

Theory Comput. Syst., 2013

Analogues of Chaitin's Omega in the computably enumerable sets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Universal computably enumerable sets and initial segment prefix-free complexity.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Tipping Points in Schelling Segregation.

[BibT_eX]

[DOI]

CoRR, 2013

Algorithmic randomness and measures of complexity.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2013

Kolmogorov complexity and computably enumerable sets.

[BibT_eX]

[DOI]

Angsheng Li

Ann. Pure Appl. Log., 2013

2012

Low upper bounds in the Turing degrees revisited.

[BibT_eX]

[DOI]

André Nies

J. Log. Comput., 2012

Compactness arguments with effectively closed sets for the study of relative randomness.

[BibT_eX]

[DOI]

J. Log. Comput., 2012

Tracing and domination in the Turing degrees.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

2011

Kolmogorov complexity of initial segments of sequences and arithmetical definability.

[BibT_eX]

[DOI]

C. S. Vlek

Theor. Comput. Sci., 2011

On the number of infinite sequences with trivial initial segment complexity.

[BibT_eX]

[DOI]

Tom F. Sterkenburg

Theor. Comput. Sci., 2011

Jump inversions inside effectively closed sets and applications to randomness.

[BibT_eX]

[DOI]

Rod Downey

Keng Meng Ng

J. Symb. Log., 2011

On Strings with Trivial Kolmogorov Complexity.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2011

Upper bounds on ideals in the computably enumerable Turing degrees.

[BibT_eX]

[DOI]

André Nies

Ann. Pure Appl. Log., 2011

2010

Relative Randomness and Cardinality.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2010

The importance of Pi01 classes in effective randomness.

[BibT_eX]

[DOI]

Keng Meng Ng

J. Symb. Log., 2010

Elementary differences between the degrees of unsolvability and degrees of compressibility.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2010

2009

Non-cupping, measure and computably enumerable splittings.

[BibT_eX]

[DOI]

Anthony Morphett

Math. Struct. Comput. Sci., 2009

K-Triviality of Closed Sets and Continuous Functions.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

2008

Randomness, lowness and degrees.

[BibT_eX]

[DOI]

Mariya Ivanova Soskova

J. Symb. Log., 2008

I classes, LR degrees and Turing degrees.

[BibT_eX]

[DOI]

Frank Stephan

Ann. Pure Appl. Log., 2008

Algorithmic randomness of continuous functions.

[BibT_eX]

[DOI]

Arch. Math. Log., 2008

2007

Algorithmic Randomness of Closed Sets.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

Post's Programme for the Ershov Hierarchy.

[BibT_eX]

[DOI]

J. Log. Comput., 2007

Randomness and the linear degrees of computability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2007

Working with the LR Degrees.

[BibT_eX]

[DOI]

Mariya Ivanova Soskova

Proceedings of the Theory and Applications of Models of Computation, 2007

K -Trivial Closed Sets and Continuous Functions.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2006

A C.E. Real That Cannot Be SW-Computed by Any Ω Number.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2006

Random reals and Lipschitz continuity.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

Random non-cupping revisited.

[BibT_eX]

[DOI]

J. Complex., 2006

A Cappable Almost Everywhere Dominating Computably Enumerable Degree.

[BibT_eX]

[DOI]

Antonio Montalbán

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

The ibT degrees of computably enumerable sets are not dense.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2006

Immunity Properties and the n-C.E. Hierarchy.

[BibT_eX]

[DOI]

Bahareh Afshari

S. Barry Cooper

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

h-monotonically computable real numbers.

[BibT_eX]

[DOI]

Xizhong Zheng

Robert Rettinger

Math. Log. Q., 2005

Hypersimplicity and semicomputability in the weak truth table degrees.

[BibT_eX]

[DOI]

Arch. Math. Log., 2005

Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Approximation representations for reals and their wtt-degrees.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

Approximation Representations for ?2 Reals.

[BibT_eX]

[DOI]

Arch. Math. Log., 2004

2003

A transfinite hierarchy of reals.

[BibT_eX]

[DOI]

Math. Log. Q., 2003

The approximation structure of a computably approximable real.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

On the Monotonic Computability of Semi-computable Real Numbers.

[BibT_eX]

[DOI]

Xizhong Zheng

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

On 0'-computable Reals.

[BibT_eX]

[DOI]