arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.3184cs.CC
收藏

算法上的随机性守恒

Randomness Conservation over Algorithms

Samuel Epstein

摘要:

当前的离散随机性和信息守恒不等式是在全递归函数上的,即仅限于确定性处理。这个限制意味着算法可以打破算法随机性守恒不等式。我们解决这个问题,证明紧边界的随机性和信息守恒方面的递归可重复的变换,即处理算法。我们还证明了保守的随机性有限字符串相对于可计算的分布,即半可计算的半措施。

英文摘要:

Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation inequalities. We address this issue by proving tight bounds of randomness and information conservation with respect to recursively enumerable transformations, i.e. processing by algorithms. We also show conservation of randomness of finite strings with respect to enumerable distributions, i.e. semicomputable semi-measures.

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

↑