Projects

Oneway functions

lala

Compression of data streams down to their information content
IEEE Trans. Inf. Theory 65 (2019)
Optimal redundancy in computations from random oracles
J. Comput. Syst. Sci. 92 (2018)

The idemetric property: when most distances are (almost) the same
Proc. R. Soc. A 475(2222) (2019)
Minority population in the 1D Schelling model of segregation
J. Stat. Phys. 173(5) (2018)
Digital morphogenesis via Schelling segregation
Nonlinearity 31 (2018)
Unperturbed Schelling Segregation in Two and Three Dimensions
J. Stat. Phys. 164(6) (2016)
Tipping Points in 1-Dimensional Schelling Models with Switching Agents
J. Stat. Phys. 158 (2015)

Analogues of Chaitin's Omega in the computably enumerable sets
Inf. Process. Lett. 113 (2013)
Universal computably enumerable sets and initial segment prefix-free complexity
Inf. Comput. 233 (2013)
Algorithmic randomness and measures of complexity
Bull. Symbolic Logic 19 (2013)
Kolmogorov complexity and computably enumerable sets
Ann. Pure Appl. Logic 164 (2013)
Randomness notions and partial relativization
Israel J. Math. 191(2) (2012)
Chaitin's halting probability and the compression of strings using oracles
Proc. R. Soc. A 467 (2011)

Aspects of Chaitin's Omega
Algorithmic Randomness: Progress and Prospects. Springer (2018)
The probability of a computable output from a random oracle
ACM Trans. Comput. Logic 18(3) (2017)
Differences of halting probabilities
J. Comput. Syst. Sci. 89 (2017)
Random numbers as probabilities of machine behaviour
Theor. Comput. Sci. 673 (2017)
Computing halting probabilities from other halting probabilities
Theor. Comput. Sci. 660 (2017)
Universality probability of a prefix-free machine
Philos. Trans. R. Soc. A 370 (2012)

The information content of typical reals
In Turing's Ideas - Significance and Impact. Springer 2014
The typical Turing degree
Proc. Lond. Math. Soc. 109 (2014)
Measure and cupping in the Turing degrees
Proc. Am. Math. Soc. 140 (2012)
Tracing and domination in the Turing degrees
Ann. Pure Appl. Logic 163 (2012)
Upper bounds on ideals in the Turing degrees
Ann. Pure Appl. Logic 162 (2011)