arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0408043cs.LOcs.CC
收藏

维数与随机性的算术复杂性

The Arithmetical Complexity of Dimension and Randomness

John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn

摘要:

构造维数和构造强维数分别是Hausdorff维数和packing维数的有效化。每个无限二进制序列A在[0,1]中被分配一个维度dim(A)和在[0,1]中的一个强维度Dim(A)。令DIM^alpha和DIMstr^alpha分别是所有维度为alpha和强维度为alpha的序列的类。我们证明了DIM^0是恰当的Pi^0_2,并且对于(0,1]中的所有Delta^0_2-可计算α,DIM^alpha是恰当的Pi^0_3。为了对强维类进行分类,我们使用了一个更强大有效的Borel层次结构,其中在Sigma^0_1水平的定义中使用了一个可共现谓词而不是可共现谓词。对于[0,1)中的所有Delta^0_2-可计算alpha,我们证明DIMstr^alpha正确地位于该层次结构的Pi^0_3层。我们证明了DIMstr^1正确地位于该层次结构的Pi^0_2层。我们还证明了Schnorr随机序列类和可计算随机序列类是恰当的Pi^0_3。

英文摘要:

Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned a dimension dim(A) in [0,1] and a strong dimension Dim(A) in [0,1]. Let DIM^alpha and DIMstr^alpha be the classes of all sequences of dimension alpha and of strong dimension alpha, respectively. We show that DIM^0 is properly Pi^0_2, and that for all Delta^0_2-computable alpha in (0,1], DIM^alpha is properly Pi^0_3. To classify the strong dimension classes, we use a more powerful effective Borel hierarchy where a co-enumerable predicate is used rather than a enumerable predicate in the definition of the Sigma^0_1 level. For all Delta^0_2-computable alpha in [0,1), we show that DIMstr^alpha is properly in the Pi^0_3 level of this hierarchy. We show that DIMstr^1 is properly in the Pi^0_2 level of this hierarchy. We also prove that the class of Schnorr random sequences and the class of computably random sequences are properly Pi^0_3.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑