Kolmogorov Complexity

$K(x)$ is the length $|P|$ of the shortest program $P$ that prints the string $x$.