On the Running Time of the Shortest Programs
The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal turing machine U. The question introduced in this paper is the following: How long do the shortest programs run for?
PDF AbstractCode
Categories
Computational Complexity
D.2.8
Datasets
Add Datasets
introduced or used in this paper
