On the Running Time of the Shortest Programs
Computational Complexity
2009-09-07 v2
Abstract
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?
Keywords
Cite
@article{arxiv.0908.1159,
title = {On the Running Time of the Shortest Programs},
author = {Norbert Bátfai},
journal= {arXiv preprint arXiv:0908.1159},
year = {2009}
}
Comments
24 pages, 15 figures; added new values to the table "The increasing of running time of the shortest programs"