A minimal pair of K-degrees

被引:12
作者
Csima, BF [1 ]
Montalbán, A [1 ]
机构
[1] Cornell Univ, Dept Math, Ithaca, NY 14853 USA
关键词
minimal pair; relative randomness;
D O I
10.1090/S0002-9939-05-08086-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We construct a minimal pair of K-degrees. We do this by showing the existence of an unbounded nondecreasing function f which forces K-triviality in the sense that gamma is an element of 2(w) is K- trivial if and only if for all n, K(gamma vertical bar n) <= K(n) + f(n) + O(1).
引用
收藏
页码:1499 / 1502
页数:4
相关论文
共 6 条
[1]  
Downey R., 2003, P 7 8 AS LOG C, P103
[2]   Randomness and reducibility [J].
Downey, RG ;
Hirschfeldt, DR ;
LaForte, G .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 68 (01) :96-114
[3]  
DOWNEY RG, IN PRESS CALIBRATING
[4]  
DOWNEY RG, IN PRESS ALGORITHMIC
[5]  
LI M, 1997, GRADUATE TEXTS COMPU
[6]   The Kolmogorov complexity of random reals [J].
Yu, L ;
Ding, DC ;
Downey, R .
ANNALS OF PURE AND APPLIED LOGIC, 2004, 129 (1-3) :163-180