Random reals and Lipschitz continuity

被引:12
作者
Lewis, Andrew E. M. [1 ]
Barmpalias, George [1 ]
机构
[1] Univ Leeds, Sch Math, Leeds LS2 9JT, W Yorkshire, England
关键词
D O I
10.1017/S0960129506005445
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Lipschitz continuity is used as a tool for analysing the relationship between incomputability and randomness. We present a simpler proof of one of the major results in this area - the theorem of Yu and Ding, which states that there exists no cl-complete c.e. real - and go on to consider the global theory. The existential theory of the cl degrees is decidable, but this does not follow immediately by the standard proof for classical structures, such as the Turing degrees, since the cl degrees are a structure without join. We go on to show that strictly below every random cl degree there is another random cl degree. Results regarding the phenomenon of quasi-maximality in the cl degrees are also presented.
引用
收藏
页码:737 / 749
页数:13
相关论文
共 15 条
[1]  
Barmpalias G, 2005, LECT NOTES COMPUT SC, V3526, P8
[2]  
BARMPALIAS G, 2005, UNPUB RANDOMNESS LIP
[3]  
BARMPALIAS G, 2005, IN PRESS NOTRE DAME
[4]   A characterization of c.e. random reals [J].
Calude, CS .
THEORETICAL COMPUTER SCIENCE, 2002, 271 (1-2) :3-14
[5]  
CHAITIN GJ, 1988, ALGORITHMIC INFORM T
[6]   Randomness, computability, and density [J].
Downey, R ;
Hirschfeldt, DR ;
Nies, A .
SIAM JOURNAL ON COMPUTING, 2002, 31 (04) :1169-1183
[7]   Randomness and reducibility [J].
Downey, RG ;
Hirschfeldt, DR ;
LaForte, G .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 68 (01) :96-114
[8]  
Downey RG, 2001, LECT NOTES COMPUT SC, V2136, P316
[9]  
DOWNEY RG, IN PRESS ALGORITHMIC
[10]  
KUCERA A, 1985, LECT NOTES MATH, V1141, P245