On the information carried by programs about the objects they compute

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

Computational Processes and Incompleteness

We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation. There is a natural classification of these processes into decidable, intermediate and complete. It is shown that in the context of standard finite injury priority arguments one cannot establish the existence of an intermediate computational process

Ergodicity and Conservativity of products of infinite transformations and their inverses

We construct a class of rank-one infinite measure-preserving transformations such that for each transformation $T$ in the class, the cartesian product $T\times T$ of the transformation with itself is ergodic, but the product $T\times T^{-1}$ of the transformation with its inverse is not ergodic. We also prove that the product of any rank-one transformation with its inverse is conservative, while there are infinite measure-preserving conservative ergodic Markov shifts whose product with their inverse is not conservative.Comment: Added references and revised some arguments; removed old section 6; main results unchange

Arithmetic complexity via effective names for random sequences

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr, and Kurtz random sets, weakly 1-generics and their complementary classes, we find that there exist characterizations of the third and fourth levels of the arithmetic hierarchy purely in terms of these notions. More generally, there exists an equivalence between arithmetic complexity and existence of numberings for classes of left-r.e. sets with shift-persistent elements. While some classes (such as Martin-L\"{o}f randoms and Kurtz non-randoms) have left-r.e. numberings, there is no canonical, or acceptable, left-r.e. numbering for any class of left-r.e. randoms. Finally, we note some fundamental differences between left-r.e. numberings for sets and reals