A superstatistical formulation of complexity measures

01/18/2021
by   Jesús Fuentes, et al.
0

It is discussed how the superstatistical formulation of effective Boltzmann factors can be related to the concept of Kolmogorov complexity, generating an infinite set of complexity measures (CMs) for quantifying information. At this level, the information is treated according to its background, which means that the CM depends on the inherent attributes of the information scenario. While the basic Boltzmann factor directly produces the standard complexity measure (SCM), it succeeds in the description of large-scale scenarios where the data components are not interrelated with themselves, thus adopting the behaviour of a gas. What happens in scenarios in which the presence of sources and sinks of information cannot be neglected, needs of a CM other than the one produced by the ordinary Boltzmann factor. We introduce a set of flexible CMs, without free parameters, that converge asymptotically to the Kolmogorov complexity, but also quantify the information in scenarios with a reasonable small density of states. We prove that these CMs are obtained from a generalised relative entropy and we suggest why such measures are the only compatible generalisations of the SCM.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2017

Comparing Information-Theoretic Measures of Complexity in Boltzmann Machines

In the past three decades, many theoretical measures of complexity have ...
research
09/26/2022

Relating description complexity to entropy

We demonstrate some novel links between entropy and description complexi...
research
01/05/2022

Complexity and Aesthetics in Generative and Evolutionary Art

In this paper we examine the concept of complexity as it applies to gene...
research
05/27/2019

Modelling conditional probabilities with Riemann-Theta Boltzmann Machines

The probability density function for the visible sector of a Riemann-The...
research
02/03/2021

The Enigma of Complexity

In this paper we examine the concept of complexity as it applies to gene...
research
05/26/2021

Boltzmann sampling of irreducible context-free structures in linear time

We continue our program of improving the complexity of so-called Boltzma...
research
06/14/2022

Automatic compile-time synthesis of entropy-optimal Boltzmann samplers

We present a famework for the automatic compilation of multi-parametric ...

Please sign up or login with your details

Forgot password? Click here to reset