Muchnik条件复杂性定理的变形
Variations on Muchnik's Conditional Complexity Theorem
摘要:
Muchnik关于简单条件描述的定理指出,对于所有字符串$a$和$b$,存在一个将$a$转换为$b$的短程序$p$,该程序具有最小的可能长度,并且是对$b$的简单条件。本文给出了这个定理的两个新的证明。第一种是基于二部图的在线匹配算法。第二个,基于提取器,可以推广到证明一个版本的Muchnik定理的空间有界Kolmogorov复杂性。
英文摘要:
Muchnik's theorem about simple conditional descriptions states that for all strings $a$ and $b$ there exists a short program $p$ transforming $a$ to $b$ that has the least possible length and is simple conditional on $b$. In this paper we present two new proofs of this theorem. The first one is based on the on-line matching algorithm for bipartite graphs. The second one, based on extractors, can be generalized to prove a version of Muchnik's theorem for space-bounded Kolmogorov complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。