# Facticity as the amount of self-descriptive information in a data set

@article{Adriaans2012FacticityAT, title={Facticity as the amount of self-descriptive information in a data set}, author={Pieter W. Adriaans}, journal={ArXiv}, year={2012}, volume={abs/1203.2245} }

Using the theory of Kolmogorov complexity the notion of facticity {\phi}(x) of a string is defined as the amount of self-descriptive information it contains. It is proved that (under reasonable assumptions: the existence of an empty machine and the availability of a faithful index) facticity is definite, i.e. random strings have facticity 0 and for compressible strings 0 < {\phi}(x) < 1/2 |x| + O(1). Consequently facticity measures the tension in a data set between structural and ad-hoc…

## 19 Citations

### On Information Conservation and Algorithmic Complexity

- Computer Science
- 2015

It is proved that universal Turing machines do not conserve information in a strong sense, but it is conjecture the existence of at least one such machine U, and introduced Information Conserving Algorithmic complexity K∗, defined on a kernel space of random strings.

### Two Problems for Sophistication

- Computer ScienceALT
- 2015

This work describes two fundamental problems with existing proposals of Kolmogorov complexity: it may be impossible to objectively quantify the sophistication and many of them are shown to be unsound.

### Organized Complexity: is Big History a Big Computation?

- Computer ScienceArXiv
- 2016

It is argued in this paper that organized complexity is a valid and useful way to make sense of big history and has a rigorous formal definition in theoretical computer science that hints at a broader research program to quantify complexity in the universe.

### Effective Complexity: In Which Sense is It Informative?

- Computer Science
- 2020

This work responds to a criticism of effective complexity made by James McAllister, according to which such a notion is not an appropriate measure for information content and argues that effective complexity is an interesting epistemological concept that may be applied to better understand crucial issues related to context dependence.

### Effective Complexity: In Which Sense is It Informative?

- Computer ScienceJournal for General Philosophy of Science
- 2020

This work responds to a criticism of effective complexity made by James McAllister, according to which such a notion is not an appropriate measure for information content and argues that effective complexity is an interesting epistemological concept that may be applied to better understand crucial issues related to context dependence.

### Notes on ensembles as a model of theory choice

- Computer Science
- 2012

This paper examines the foundations of the concept of effective complexity proposed by Murray Gell-Mann and Seth Lloyd using the methods of Bayesian inference. Given a data string, x Î 80, 1< of…

### A Safe Approximation for Kolmogorov Complexity

- Computer ScienceALT
- 2014

The Kolmogorov complexity method is applied to the normalized information distance (NID) and conditions that affect the safety of the approximation are discussed.

### Maximum entropy economics

- EconomicsThe European Physical Journal Special Topics
- 2020

A coherent statistical methodology is necessary for analyzing and understanding complex economic systems characterized by large degrees of freedom with non-trivial patterns of interaction and…

### Maximum entropy economics

- Economics
- 2020

A coherent statistical methodology is necessary for analyzing and understanding complex economic systems characterized by large degrees of freedom with non-trivial patterns of interaction and…

### UvA-DARE (Digital Academic Repository) A safe approximation for Kolmogorov complexity

- Computer Science
- 2014

This work constructs a computable function κ to approximate K in a probabilistic sense: the probability that the error is greater than k decays exponentially with k, and applies this method to the normalized information distance (NID).

## 36 References

### Between Order and Chaos: The Quest for Meaningful Information

- Computer ScienceTheory of Computing Systems
- 2009

A theoretical framework that can be seen as a first approximation to a study of meaningful information is developed and it is proved that, under adequate measurement conditions, the free energy of a system in the world is associated with the randomness deficiency of a data set with observations about this system.

### Meaningful Information

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2006

The theory of recursive functions statistic, the maximum and minimum value, the existence of absolutely nonstochastic objects (that have maximal sophistication-all the information in them is meaningful and there is no residual randomness), and the relation to the halting problem and further algorithmic properties are developed.

### Kolmogorov's structure functions and model selection

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2004

The goodness-of-fit of an individual model with respect to individual data is precisely quantify and it is shown that-within the obvious constraints-every graph is realized by the structure function of some data.

### Using MDL for Grammar Induction

- Computer ScienceICGI
- 2006

It is proved that, in DFA induction, already as a result of a single deterministic merge of two nodes, divergence of randomness deficiency and MDL code can occur, which shows why the applications of MDL to grammar induction so far have been disappointing.

### Effective Complexity as a Measure of Information Content

- Computer SciencePhilosophy of Science
- 2003

This paper argues that the effective complexity of a given string is not uniquely determined, and the concept of effective complexity is unsuitable as a measure of information content.

### Logical depth and physical complexity

- Computer Science
- 1988

This work defines an object’s “logical depth” as the time required by a standard universal Turing machine to generate it from an input that is algorithmically random (i.e. Martin-Lof random), and applies depth to the physical problem of “self-organization.”

### An Introduction to Kolmogorov Complexity and Its Applications

- Computer ScienceTexts and Monographs in Computer Science
- 1993

The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.

### The calculi of emergence: computation, dynamics and induction

- Computer Science
- 1994

### Computational depth: Concept and applications

- Computer Science, MathematicsTheor. Comput. Sci.
- 2006

### Effective Complexity

- Computer Science
- 1995

The effective complexity (EC) of an entity is defined as the length of a highly compressed description of its regularities, and a formal approach is needed both to the notion of minimum description length and to the distinction between regularities and those features that are treated as random or incidental.