activity
20062021
most citedFacticity as the amount of self-descriptive information in a data set

9 citations · 13 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IT2021

Differential information theory

Pieter Adriaans

This paper presents a new foundational approach to information theory based on the concept of the information efficiency of a recursive function, which is defined as the difference…

cs.CC2019★ 1 cited

Semi-Countable Sets and their Application to Search Problems

P. W. Adriaans

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we…

cs.DM2018★ 1 cited

A simple information theoretical proof of the Fueter-Pólya Conjecture

Pieter W. Adriaans

We present a simple information theoretical proof of the Fueter-Pólya Conjecture: there is no polynomial pairing function that defines a bijection between the set of natural number…

cs.IT2016★ 2 cited

A General Theory of Information and Computation

P. W. Adriaans

This paper fills a gap in our understanding of the interaction between information and computation. It unifies other approaches to measuring information like Kolmogorov complexity…

cs.IT2012★ 9 cited

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

Pieter Adriaans

Using the theory of Kolmogorov complexity the notion of facticity ϕ(x) of a string is defined as the amount of self-descriptive information it contains. It is proved that (under re…

cs.LG2006

Approximation of the Two-Part MDL Code

Pieter Adriaans, Paul Vitanyi

Approximation of the optimal two-part MDL code for given data, through successive monotonically length-decreasing two-part MDL codes, has the following properties: (i) computation…