m-sophistication

Details m-sophistication m-sophistication

2010-01-26

arxiv.org/abs/1001.4687v1

Computer Science

Computational Complexity

13 pages, draft

Scientific paper

The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by sophistication within small additive terms. It is also shown that m-sophistication and coarse sophistication can not be approximated by an upper or lower semicomputable function, not even within very large error.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644746