AI Chat AI Image Generator AI Video Text to Speech

On the Algorithmic Probability of Sets

07/10/2019

∙

by Samuel Epstein, et al.

∙

∙

The combined universal probability m(D) of strings x in sets D is close to max (x) over x in D: their logs differ by at most D's information I(D:H) about the halting sequence H. As a result of this, given a binary predicate P, the length of the smallest program that computes a complete extension of P is less than the size of the domain of P plus the amount of information that P has with the halting sequence.

research

∙ 07/10/2019

On the Complexity of Completing Binary Predicates

Given a binary predicate P, the length of the smallest program that comp...

0 Samuel Epstein, et al. ∙

research

∙ 10/12/2020

Quines are the fittest programs: Nesting algorithmic probability converges to constructors

In this article we explore the limiting behavior of the universal prior ...

0 Aritra Sarkar, et al. ∙

research

∙ 08/30/2020

Precise Expression for the Algorithmic Information Distance

We consider the notion of information distance between two objects x and...

0 Bruno Bauwens, et al. ∙

research

∙ 11/20/2017

A Separation Between Run-Length SLPs and LZ77

In this paper we give an infinite family of strings for which the length...

0 Philip Bille, et al. ∙

research

∙ 05/10/2023

Fundamental Limits of Multiple Sequence Reconstruction from Substrings

The problem of reconstructing a sequence from the set of its length-k su...

0 Kel Levick, et al. ∙

research

∙ 09/03/2019

A Note on the Probability of Rectangles for Correlated Binary Strings

Consider two sequences of n independent and identically distributed fair...

0 Or Ordentlich, et al. ∙

research

∙ 07/29/2018

Information Distance Revisited

We consider the notion of information distance between two objects x and...

0 Bruno Bauwens, et al. ∙