97 research outputs found
Kolmogorov complexity and computably enumerable sets
We study the computably enumerable sets in terms of the: (a) Kolmogorov
complexity of their initial segments; (b) Kolmogorov complexity of finite
programs when they are used as oracles. We present an extended discussion of
the existing research on this topic, along with recent developments and open
problems. Besides this survey, our main original result is the following
characterization of the computably enumerable sets with trivial initial segment
prefix-free complexity. A computably enumerable set is -trivial if and
only if the family of sets with complexity bounded by the complexity of is
uniformly computable from the halting problem
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
AbstractWe show that there exists an almost everywhere (a.e.) dominating computably enumerable (c.e.) degree which is half of a minimal pair
Computing halting probabilities from other halting probabilities
The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega number, and is the most well known example of a real which is random in the sense of Martin-L\"{o}f. Although omega numbers depend on the underlying universal Turing machine, they are robust in the sense that they all have the same Turing degree, namely the degree of the halting problem. In this paper we give precise bounds on the redundancy growth rate that is generally required for the computation of an omega number from another omega number. We show that for each ϵ>1, any pair of omega numbers compute each other with redundancy ϵlogn. On the other hand, this is not true for ϵ=1. In fact, we show that for each omega number there exists another omega number which is not computable from the first one with redundancy logn. This latter result improves an older result of Frank Stephan
Unperturbed Schelling segregation in two or three dimensions
Schelling's models of segregation, first described in 1969 [18] are among the best known models of self-organising behaviour. Their original purpose was to identify mechanisms of urban racial segregation. But his models form part of a family which arises in statistical mechanics, neural networks, social science, and beyond, where populations of agents interact on networks. Despite extensive study, unperturbed Schelling models have largely resisted rigorous analysis, prior results generally focusing on variants in which noise is introduced into the dynamics, the resulting system being amenable to standard techniques from statistical mechanics or stochastic evolutionary game theory [25]. A series of recent papers [6, 3, 4], has seen the first rigorous analyses of 1-dimensional unperturbed Schelling models, in an asymptotic framework largely unknown in statistical mechanics. Here we provide the first such analysis of 2- and 3-dimensional unperturbed models, establishing most of the phase diagram, and answering a challenge from [6]
- …