On the polynomial depth of various sets of random strings

Details On the polynomial depth of various sets of random strings On the polynomial depth of various sets of random strings

2010-12-16

arxiv.org/abs/1012.3548v2

Computer Science

Computational Complexity

Scientific paper

This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e., both trivial and random sequences are not monotone poly deep, monotone poly depth satisfies the slow growth law i.e., no simple process can transform a non deep sequence into a deep one, and monotone poly deep sequences exist (unconditionally). We give two natural examples of deep sets, by showing that both the set of Levin-random strings and the set of Kolmogorov random strings are monotone poly deep.

Affiliated with

Also associated with

No associations

Rating

On the polynomial depth of various sets of random strings 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 polynomial depth of various sets of random strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the polynomial depth of various sets of random strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218667