Depth as Randomness Deficiency

Details Depth as Randomness Deficiency Depth as Randomness Deficiency

2008-09-15

arxiv.org/abs/0809.2546v1

Computer Science

Computational Complexity

Lates, 15 pages, no figures. Theory of Computing Systems, To appear

Scientific paper

Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditional lower bound on the computation time from a given program in absence of auxiliary information. Variants known as logical depth and computational depth are expressed in Kolmogorov complexity theory. We derive quantitative relation between logical depth and computational depth and unify the different depth notions by relating them to A. Kolmogorov and L. Levin's fruitful notion of randomness deficiency. Subsequently, we revisit the computational depth of infinite strings, introducing the notion of super deep sequences and relate it with other approaches.

Affiliated with

Also associated with

No associations

Rating

Depth as Randomness Deficiency 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 Depth as Randomness Deficiency, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Depth as Randomness Deficiency will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635495