On the Running Time of the Shortest Programs

Details On the Running Time of the Shortest Programs On the Running Time of the Shortest Programs

2009-08-10

arxiv.org/abs/0908.1159v2

Computer Science

Computational Complexity

24 pages, 15 figures; added new values to the table "The increasing of running time of the shortest programs"

Scientific paper

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?

Affiliated with

Also associated with

No associations

Rating

On the Running Time of the Shortest Programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Running Time of the Shortest Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Running Time of the Shortest Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120051