Lowness for the class of random sets

被引：41

作者：

Kucera, A

Terwijn, SA

机构：

[1] Charles Univ, Dept Comp Sci, CR-11800 Prague 1, Czech Republic

[2] Univ Amsterdam, Fac WINS ILLC, NL-1018 TV Amsterdam, Netherlands

来源：

JOURNAL OF SYMBOLIC LOGIC | 1999年 / 64卷 / 04期

关键词：

D O I：

10.2307/2586785

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A positive answer to a question of M. van Lambalgen and D. Zambella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RAND(A).

引用

页码：1396 / 1402

页数：7

共 11 条

[1]

[Anonymous], 1987, RECURSIVELY ENUMERAB

[2] EVERY SEQUENCE IS REDUCIBLE TO A RANDOM ONE [J].

GACS, P .

INFORMATION AND CONTROL, 1986, 70 (2-3) :186-192

[3] SUBSEQUENCES OF NORMAL SEQUENCES [J].

KAMAE, T .

ISRAEL JOURNAL OF MATHEMATICS, 1973, 16 (02) :121-149

[4]

KAUTZ SM, 1991, THESIS CORNELL U

[5] ON RELATIVE RANDOMNESS [J].

KUCERA, A .

ANNALS OF PURE AND APPLIED LOGIC, 1993, 63 (01) :61-67

[6]

KUCERA A, 1985, LECT NOTES MATH, V1141, P245

[7] DEFINITION OF RANDOM SEQUENCES [J].

MARTINLOF, P .

INFORMATION AND CONTROL, 1966, 9 (06) :602-+

[8]

TERWIJN SA, 1997, ML199707 ILLC U AMST

[9]

VAN LAMBALGEN M., 1987, THESIS U AMSTERDAM

[10] THE AXIOMATIZATION OF RANDOMNESS [J].

VANLAMBALGEN, M .

JOURNAL OF SYMBOLIC LOGIC, 1990, 55 (03) :1143-1167

← 1 2 →