当前位置:
X-MOL 学术
›
Inf. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Uniform van Lambalgen's theorem fails for computable randomness
Information and Computation ( IF 1 ) Pub Date : 2019-11-18 , DOI: 10.1016/j.ic.2019.104486 Bruno Bauwens
中文翻译:
统一范兰伯根定理因可计算的随机性而失败
更新日期:2019-11-18
Information and Computation ( IF 1 ) Pub Date : 2019-11-18 , DOI: 10.1016/j.ic.2019.104486 Bruno Bauwens
We show that there exists a bitsequence that is not computably random for which the odd bits are computably random and the even bits are computably random relative to the odd bits.
中文翻译:
统一范兰伯根定理因可计算的随机性而失败
我们表明,存在一个不可计算的随机位序列,相对于奇数位,奇数位是可计算的,偶数位是可计算的。