Reading Suggestions - 9th Aug 23

The cloud directory for the files in the reading suggestions is Reading directory, where there are subdirectories according to the date of the suggestions.

Reading activities can also be combined with the seminar.

Today’s suggestions (mostly recent work) are:

• Chaitin’s Omega and an algorithmic phase transition

• The Complexity of Contracts

• Find a witness or shatter: the landscape of computable PAC learning

• Turing Degrees and Randomness for Continuous Measures

• A Survey on Using Kolmogorov Complexity in Cybersecurity

• Benign approximations and non-speedability

• Cone avoidance and randomness preservation

• Kolmogorov Complexity Leads to a Representation Theorem for Idempotent Probabilities

• An Information Theoretic Representation of Agent Dynamics as Set Intersections

• A pair of universal sequence-set betting strategies

• Algorithmic Statistics

• Learnability can be undecidable

• A learning-theoretic characterisation of Martin-Lof randomness and Schnorr randomness

• Solovay reducibility and continuity

• Open questions on randomness and uniform distribution