Randomness and Computability
Year: 2011
Type: dissertation
Abstract: This thesis establishes significant new results in the area of algorithmic randomness.\nThese results elucidate the deep relationship between randomness\nand computability.\nA number of results focus on randomness for finite strings. Levin introduced\ntwo functions which measure the randomness of finite strings. One\nfunction is derived from a universal monotone machine and the other function\nis derived from an optimal computably enumerable semimeasure. Gacs\nproved that infinitely often, the gap between these two functions exceeds the\ninverse Ackermann function (applied to string length). This thesis improves\nthis result to show that infinitely often the difference between these two functions\nexceeds the double logarithm. Another separation result is proved for\ntwo different kinds of process machine.\nInformation about the randomness of finite strings can be used as a computational\nresource. This information is contained in the overgraph. Muchnik\nand Positselsky asked whether there exists an optimal monotone machine\nwhose overgraph is not truth-table complete. This question is answered in the\nnegative. Related results are also established.\nThis thesis makes advances in the theory of randomness for infinite binary\nsequences. A variant of process machines is used to characterise computable\nrandomness, Schnorr randomness and weak randomness. This result is extended\nto give characterisations of these types of randomness using truthtable\nreducibility. The computable Lipschitz reducibility measures both the\nrelative randomness and the relative computational power of real numbers. It\nis proved that the computable Lipschitz degrees of computably enumerable\nsets are not dense.\nInfinite binary sequences can be regarded as elements of Cantor space.\nMost research in randomness for Cantor space has been conducted using the\nuniform measure. However, the study of non-computable measures has led to\ninteresting results. This thesis shows that the two approaches that have been\nused to define randomness on Cantor space for non-computable measures:\nthat of Reimann and Slaman, along with the uniform test approach first introduced\nby Levin and also used by Gacs, Hoyrup and Rojas, are equivalent.\nLevin established the existence of probability measures for which all infinite sequences are random. These measures are termed neutral measures. It is\nshown that every PA degree computes a neutral measure. Work of Miller is\nused to show that the set of atoms of a neutral measure is a countable Scott set\nand in fact any countable Scott set is the set of atoms of some neutral measure.\nNeutral measures are used to prove new results in computability theory. For\nexample, it is shown that the low computable enumerable sets are precisely\nthe computably enumerable sets bounded by PA degrees strictly below the\nhalting problem.\nThis thesis applies ideas developed in the study of randomness to computability\ntheory by examining indifferent sets for comeager classes in Cantor\nspace. A number of results are proved. For example, it is shown that there\nexist 1-generic sets that can compute their own indifferent sets.
Source: Figshare
Author: Adam R. Day
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1522541949
