Applying randomness to computability
André Nies · ResearchSpace (University of Auckland) · 2009
A little history I Up to the year 1998 or so, the randomness aspect received little attention from computability theorists. I It was confined to very good but isolated work such as Solovay’s manuscript (1975), Kurtz’ thesis (1981), Kautz’ thesis (1990), little-known work by Demuth, and Kucera’s 1985-1993 papers. I More recently, it has become widely known that randomness-related concepts enrich computability theory. I For instance, they help us to understand properties saying a set is very close to being computable.