Refined Bounds on Kolmogorov Complexity for ω-Languages

Abstract

The paper investigates bounds on various notions of complexity for ω-languages. We understand the complexity of an ω-languages as the complexity of the most complex strings contained in it. There have been shown bounds on simple and prefix complexity using fractal Hausdorff dimension. Here these bounds are refined by using general Hausdorff measure originally introduced by Felix Hausdorff. Furthermore a lower bound for a priori complexity is shown.

A Correspondence Principle for Exact Constructive Dimension

“…Unlike the classical case where the computable (even the rational) numbers are dense in the reals, for gauge functions it holds that, if α ∈ (0, 1) is not a computable real, there is no computable function between h α (t) = t α and h α (t) = t α + log r 1 t . First we mention the following general lower bound to the complexity function KA from [Mie08] together with Eq. (5) yields a tight estimate for gauge functions satisfying F ⊆ S c,h [U ] for arbitrary F ⊆ X ω (cf.…”

Bounds on the Kolmogorov Complexity Function for Infinite Words

“…In this section two bounds on the Kolmogorov complexity function from [Sta93] and [Mie08] are presented. Both are lower bounds which illustrate the principle that large sets contain complex elements.…”