<p>Let's assume we use TMs to describe the Kolmogorov Complexity of words over $\{0,1\}$. Since we can encode any string over a finite alphabet as binary string we don't lose generality.</p>

<p>Using Gödel Numbering we can encode every TM $M$ as a string over $\{0,1\}$. If there is an input $x$ such that $M$ outputs $w$ on input $x$, in symbols $&lt;M,x&gt;=w$, then the length of this description of $w$ is the length of the concatenated binary string of $M$ and $x$, in symbols $|M \circ x|$.</p>

<p>Now, due to your request we have a TM $M$ that decides our language $L$. That implies that $M$ halts on every input(a semi-decision algorithm would be sufficient as well but the following algorithm would be slightly more cumbersome). With $M$ we can construct a TM $M'$ which enumerates $L$. That means $M'$ on some input $n$, which we will interpret as a natural number but 0, does the following:</p>

<pre><code>counter := 0
for all x in {0,1}^*
    if x in L then counter++
    if counter = n then break
return x
</code></pre>

<p>To decide $x$ in $L$ we use $M$. Additionally, I'd consider it useful that the sequence of all binary strings should be traversed in ascending order w.r.t length(for assessing the quality of our upper boundary later on).</p>

<p>Now, let for all words $w \in L$ be $f(w)$ the natural number such that $&lt;M',f(w)&gt; = w$. Then we can state an upper bound for the KC of any word $w$ in $L$ as </p>

<p>$K(w) \leq |M' \circ bin(f(w))|$</p>

<p>with $bin(x)$ being the binary representation we also use to pass $f(w)$ as input to $M'$. Extra: the quality of our upper bound for the larger words in $L$ can be estimated by comparing the growth rate of $|w|$ to $log_2(f(w))$.</p>

CC BY-SA 3.0
2013-08-31T19:03:50.353Z
In summary: if $w \in L$ is the $i$-th word recognized by the decider $P$, then $K(w) \leq \log(i) + c$
Marzio De Biasi
CC BY-SA 3.0
2013-08-31T09:04:11.427Z
2013-08-31T16:16:54.353Z
2013-08-31T16:16:54.353Z
John D.
<p>Suppose we have a program(algorithm) that solves some decision problem $(\Sigma,L)$.</p>

<p>Given the program, can we always say something about the Kolmogorov complexity of the words in $L$ ?</p>

<kolmogorov-complexity>
What information can a program give about the Kolmogorov Complexity of its accepting Language
Subhayan
# What information can a program give about the Kolmogorov Complexity of its accepting Language

(Asked by: username_0 on 2013-08-31)

Suppose we have a program(algorithm) that solves some decision problem $(\Sigma,L)$.

Given the program, can we always say something about the Kolmogorov complexity of the words in $L$ ?

**Tags:** kolmogorov-complexity


---

## 1 answers

### Answer by username_1 on 2013-08-31. Score: 2 | Accepted answer

Let's assume we use TMs to describe the Kolmogorov Complexity of words over $\{0,1\}$. Since we can encode any string over a finite alphabet as binary string we don't lose generality.
Using Gödel Numbering we can encode every TM $M$ as a string over $\{0,1\}$. If there is an input $x$ such that $M$ outputs $w$ on input $x$, in symbols $=w$, then the length of this description of $w$ is the length of the concatenated binary string of $M$ and $x$, in symbols $|M \circ x|$.
Now, due to your request we have a TM $M$ that decides our language $L$. That implies that $M$ halts on every input(a semi-decision algorithm would be sufficient as well but the following algorithm would be slightly more cumbersome). With $M$ we can construct a TM $M'$ which enumerates $L$. That means $M'$ on some input $n$, which we will interpret as a natural number but 0, does the following:
counter := 0
for all x in {0,1}^*
    if x in L then counter++
    if counter = n then break
return x

To decide $x$ in $L$ we use $M$. Additionally, I'd consider it useful that the sequence of all binary strings should be traversed in ascending order w.r.t length(for assessing the quality of our upper boundary later on).
Now, let for all words $w \in L$ be $f(w)$ the natural number such that $ = w$. Then we can state an upper bound for the KC of any word $w$ in $L$ as 
$K(w) \leq |M' \circ bin(f(w))|$
with $bin(x)$ being the binary representation we also use to pass $f(w)$ as input to $M'$. Extra: the quality of our upper bound for the larger words in $L$ can be estimated by comparing the growth rate of $|w|$ to $log_2(f(w))$.

> **Comments:**
> **username_2**: In summary: if $w \in L$ is the $i$-th word recognized by the decider $P$, then $K(w) \leq \log(i) + c$  

---

