Keng Meng (Selwyn) Ng, Nanyang Technological University
“Measuring the relative strength of sets of natural numbers.”
The study of algorithmic randomness, in particular of lowness properties in randomness has led to many exciting recent developments in the area. In particular this has provided us a tool to compare the amount of inherent ”information” present in sets of natural numbers, using what is known as ”weak reducibilities”. In this talk we will mention some related results, and explore the notion of an LR-base for randomness. We present several new results about this class, and investigate its position in the jump-traceable hierarchy. This is joint work with Johanna Franklin and Reed Solomon.