Abstract : In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an infinite tape. What additional information do programs provide? We characterize this additional information to be any upper bound on the Kolmogorov complexity of the object. Hence we identify the exact relationship between Markov computability and Type-2 computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov semidecidable sets.
