Uniform Kurtz randomness

被引:4
作者
Kihara, Takayuki [1 ]
Miyabe, Kenshi [2 ]
机构
[1] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Ishikawa 9231292, Japan
[2] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo 1138656, Japan
关键词
Algorithmic randomness; Kurtz randomness; uniform relativization; van Lambalgen's theorem; lowness for randomness; effective dimension; LOWNESS; THEOREM; SETS;
D O I
10.1093/logcom/ext054
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. This notion has more natural properties than the usual relativization. For instance, van Lambalgen's theorem holds for uniform Kurtz randomness but not for (the usual relativization of) Kurtz randomness. Another advantage is that lowness for uniform Kurtz randomness has many characterizations, such as those via complexity, martingales, Kurtz tt-traceability and Kurtz dimensional measure.
引用
收藏
页码:863 / 882
页数:20
相关论文
共 36 条
[31]  
Stephan F, 2006, LECT NOTES COMPUT SC, V3959, P756
[32]   Computational randomness and lowness [J].
Terwijn, SA ;
Zambella, D .
JOURNAL OF SYMBOLIC LOGIC, 2001, 66 (03) :1199-1205
[33]  
Wang Y., 1996, THESIS U HEIDELBERG
[34]  
Weihrauch K., 2000, An EATCS Series
[35]  
Weihrauch K, 2009, J UNIVERS COMPUT SCI, V15, P1381
[36]   When van Lambalgen's Theorem fails [J].
Yu, Liang .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2007, 135 (03) :861-864