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

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

2012-03-10

arxiv.org/abs/1203.2245v1

Computer Science

Information Theory

10 pages, 2 figures

Scientific paper

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 information objectively. For binary strings there is a so-called facticity threshold that is dependent on their entropy. Strings with facticty above this threshold have no optimal stochastic model and are essentially computational. The shape of the facticty versus entropy plot coincides with the well-known sawtooth curves observed in complex systems. The notion of factic processes is discussed. This approach overcomes problems with earlier proposals to use two-part code to define the meaningfulness or usefulness of a data set.

Affiliated with

Also associated with

No associations

Rating

Facticity as the amount of self-descriptive information in a data set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Facticity as the amount of self-descriptive information in a data set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Facticity as the amount of self-descriptive information in a data set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488513