Universality probability of a prefix-free machine

被引：7
|
作者：
Barmpalias, George [1 ]
Dowe, David L. [2 ]
机构：
[1] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China
[2] Monash Univ, Clayton Sch IT, Sch Comp Sci & Software Engn, Clayton, Vic 3800, Australia
来源：
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES | 2012年 / 370卷 / 1971期
基金：
中国国家自然科学基金;
关键词：
Kolmogorov complexity; prefix-free complexity; universality probability; algorithmic randomness; RANDOMNESS; CHAITIN; REALS;
D O I：
10.1098/rsta.2011.0319
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
We study the notion of universality probability of a universal prefix-free machine, as introduced by C. S. Wallace. We show that it is random relative to the third iterate of the halting problem and determine its Turing degree and its place in the arithmetical hierarchy of complexity. Furthermore, we give a computational characterization of the real numbers that are universality probabilities of universal prefix-free machines.
引用
收藏
页码：3488 / 3511
页数：24
相关论文
共 50 条
  • [31] Multi-Rate Prefix-Free Code Distribution Matching
    Cho, Junho
    Winzer, Peter J.
    2019 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION (OFC), 2019,
  • [32] Prefix-free languages and initial segments of computably enumerable degrees
    Wu, GH
    COMPUTING AND COMBINATORICS, 2001, 2108 : 576 - 585
  • [33] State Complexity of Combined Operations for Prefix-Free Regular Languages
    Han, Yo-Sub
    Salomaa, Kai
    Yu, Sheng
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 398 - +
  • [34] Rate of Prefix-free Codes in LQG Control Systems with Side Information
    Cuvelier, Travis C.
    Tanaka, Takashi
    2021 55TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2021,
  • [35] On the construction of prefix-free and fix-free codes with specified codeword compositions
    Kakhbod, Ali
    Zadimoghaddam, Morteza
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (18) : 2269 - 2275
  • [36] Not every domain of a plain decompressor contains the domain of a prefix-free one
    Andreev, Mikhail
    Razenshteyn, Ilya
    Shen, Alexander
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 482 - 486
  • [37] Decision Procedure for the Existence of Two-Channel Prefix-Free Codes
    Yin, Hoover H. F.
    Ng, Ka Hei
    Shing, Yu Ting
    Lai, Russell W. F.
    Wang, Xishi
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1522 - 1526
  • [38] Simple Worst-Case Optimal Adaptive Prefix-Free Coding
    Gagie, Travis
    DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 453 - 453
  • [39] Building a pangenome alignment index via recursive prefix-free parsing
    Ferro, Eddie
    Oliva, Marco
    Gagie, Travis
    Boucher, Christina
    ISCIENCE, 2024, 27 (10)
  • [40] On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
    Baartse, Martijn
    Barmpalias, George
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (01) : 28 - 47
12345