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 条
  • [21] AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (05) : 679 - 687
  • [22] A pumping lemma for regular closure of prefix-free languages
    Koga, Toshihiro
    INFORMATION AND COMPUTATION, 2022, 289
  • [23] Recursive Prefix-Free Parsing for Building Big BWTs
    Oliva, Marco
    Gagie, Travis
    Boucher, Christina
    2023 DATA COMPRESSION CONFERENCE, DCC, 2023, : 62 - 70
  • [24] Prefix-free languages: Left and right quotient and reversal
    Jirasek, Jozef
    Jiraskova, Galina
    Krausova, Monika
    Mlynarcik, Peter
    Sebej, Juraj
    THEORETICAL COMPUTER SCIENCE, 2016, 610 : 78 - 90
  • [25] Differentiability of four prefix-free PGV hash functions
    Kuwakado, Hidenori
    Hirose, Shoichi
    IEICE ELECTRONICS EXPRESS, 2009, 6 (13): : 955 - 958
  • [26] State Complexity of Boundary of Prefix-Free Regular Language
    Eom, Hae-Sung
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (06) : 697 - 707
  • [27] Evolutionary double-pipe prefix-free hash function
    Mirvaziri, Hamid
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2020, 41 (05): : 1175 - 1191
  • [28] Simplicity via provability for universal prefix-free Turing machines
    Calude, Cristian S.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (1-2) : 178 - 182
  • [29] Prefix-Free Code Distribution Matching for Probabilistic Constellation Shaping
    Cho, Junho
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (02) : 670 - 682
  • [30] Simplicity via Provability for Universal Prefix-free Turing Machines
    Calude, Cristian S.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (01): : 16 - 21
12345