arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.4687cs.CC
收藏

m-复杂度

m-sophistication

Bruno Bauwens

摘要:

有限二进制串x的m-复杂度被引入作为证明复杂度的复杂度是罕见的一些参数的推广。给出了x的一个概率近充分统计量,其长度的上界为x在小可加项内的m-复杂度.这表明,m-复杂度的下界是由粗复杂度和上界的复杂度在小的加法项。它也表明,m-复杂度和粗糙复杂度不能近似的上或下半可计算的功能,甚至在非常大的误差。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑