m-sophistication

The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by sophistication within small additive terms. It is also shown that m-sophistication and coarse sophistication can not be approximated by an upper or lower semicomputable function, not even within very large error.Comment: 13 pages, draf

Influence tests I: ideal composite hypothesis tests, and causal semimeasures

Ratios of universal enumerable semimeasures corresponding to hypotheses are investigated as a solution for statistical composite hypotheses testing if an unbounded amount of computation time can be assumed. Influence testing for discrete time series is defined using generalized structural equations. Several ideal tests are introduced, and it is argued that when Halting information is transmitted, in some cases, instantaneous cause and consequence can be inferred where this is not possible classically. The approach is contrasted with Bayesian definitions of influence, where it is left open whether all Bayesian causal associations of universal semimeasures are equal within a constant. Finally the approach is also contrasted with existing engineering procedures for influence and theoretical definitions of causation.Comment: 29 pages, 3 figures, draf

L'information algorithmique en physique : émergence, sophistication et localité quantique

Cette thèse explore des aspects du monde naturel par la lentille de l'information algorithmique. La notion de l'émergence, intuitivement reliée à tant de phénomènes naturels, se voit offrir une définition cadrée dans le domaine plus spécifique des statistiques algorithmiques. Capturant toutes deux l'organisation non triviale d'un objet, la sophistication et la profondeur logique sont relativisées à un objet auxiliaire puis remises en relation. Enfin, des modèles proposant une description locale des systèmes quantiques sont démontrés équivalents, ont leur coût de description quantifié et sont généralisés aux systèmes continus.This thesis explores aspects of the physical world through the lens of algorithmic information. The notion of emergence, intuitively linked to many natural phenomena, is offered a definition framed in the field of algorithmic statistics. Both capturing non-trivial organization of an object, sophistication and logical depth are compared once relativized to an auxiliary object. Finally, models proposing a local description of the quantum systems are shown equivalent, have their description cost quantified and are generalized to continuous systems

Computability Theory

Computability is one of the fundamental notions of mathematics, trying to capture the effective content of mathematics. Starting from Gödel’s Incompleteness Theorem, it has now blossomed into a rich area with strong connections with other areas of mathematical logic as well as algebra and theoretical computer science