AI Chat AI Image Generator AI Video Text to Speech

On the Complexity of Completing Binary Predicates

07/10/2019

∙

by Samuel Epstein, et al.

∙

∙

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. This result is derived from a theorem in this paper which says a prefix free set with large M measure will have small monotone complexity, Km.

page 1

page 2

page 3

page 4

research

∙ 07/10/2019

On the Algorithmic Probability of Sets

The combined universal probability m(D) of strings x in sets D is close ...

0 Samuel Epstein, et al. ∙

research

∙ 02/19/2020

On Function Description

The main result is that: function descriptions are not made equal, and t...

0 Rade Vuckovac, et al. ∙

research

∙ 01/28/2022

On the Kolmogorov Complexity of Binary Classifiers

We provide tight upper and lower bounds on the expected minimum Kolmogor...

0 Samuel Epstein, et al. ∙

research

∙ 12/26/2021

The Sketching and Communication Complexity of Subsequence Detection

We study the sketching and communication complexity of deciding whether ...

0 Mason DiCicco, et al. ∙

research

∙ 09/17/2017

Kolmogorov Complexity and Information Content

In this paper, we revisit a central concept in Kolmogorov complexity in ...

0 Fouad B. Chedid, et al. ∙

research

∙ 02/06/2018

Fixing monotone Boolean networks asynchronously

The asynchronous automaton associated with a Boolean network f:{0,1}^n→{...

0 Julio Aracena, et al. ∙

research

∙ 01/19/2007

Algorithmic Complexity Bounds on Future Prediction Errors

We bound the future loss when predicting any (computably) stochastic seq...

0 A. Chernov, et al. ∙