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 条
  • [1] The Boundary of Prefix-Free Languages
    Jirasek, Jozef
    Jiraskova, Galina
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 300 - 312
  • [2] Prefix-free Lukasiewicz languages
    Staiger, Ludwig
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (06) : 1417 - 1423
  • [3] The structure of optimal prefix-free codes in restricted languages: The uniform probability case
    Golin, MJ
    Liu, ZM
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 372 - 384
  • [4] Complexity in Prefix-Free Regular Languages
    Jiraskova, Galina
    Krausova, Monika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 197 - 204
  • [5] Prefix-free quantum Kolmogorov complexity
    Bhojraj, Tejas
    THEORETICAL COMPUTER SCIENCE, 2021, 875 : 65 - 80
  • [6] Prefix-Free and Prefix-Correct Complexities with Compound Conditions
    Kalinina, Elena
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 259 - 265
  • [7] PREFIX-FREE LANGUAGES AS OMEGA-GENERATORS
    LITOVSKY, I
    INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 61 - 65
  • [8] DERIVATIVES AND QUOTIENTS OF PREFIX-FREE CONTEXT-FREE LANGUAGES
    HUGHES, CE
    INFORMATION AND CONTROL, 1980, 45 (03): : 229 - 235
  • [9] Kuratowski Algebras Generated by Prefix-Free Languages
    Jirasek, Jozef, Jr.
    Sebej, Juraj
    Implementation and Application of Automata, 2016, 9705 : 150 - 162
  • [10] Prefix-Free Languages: Right Quotient and Reversal
    Jirasek, Jozef
    Jiraskova, Galina
    Krausova, Monika
    Mlynarcik, Peter
    Sebej, Juraj
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 210 - 221
12345