Universal recursively enumerable sets of strings-Reference-Cited by-同舟云学术

Universal recursively enumerable sets of strings

Published:2011-05 Issue:22 Volume:412 Page:2253-2261
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Calude Cristian S.,Nies André,Staiger Ludwig,Stephan Frank

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. Mikhail Andreev, Ilya Razenshteyn and Alexander Shen, Not every domain of a plain decompressor contains the domain of a prefix-free one, in: F. Ferreira, H. Guerra, E. Majordomo, J. Rasga (Eds.), Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Abstract and Handbook Booklet, University of Azores, Ponta Delgada, Azores, Portugal, 2010, pp. 31–37, Technical Report CoRR abs/1001.4462, 2010.

2. Information and Randomness: An Algorithmic Perspective;Calude,2002

3. Recursively enumerable reals and Chaitin Ω numbers;Calude;Theoretical Computer Science,2001

4. Universal recursively enumerable sets of strings;Calude,2008

5. On universal computably enumerable prefix codes;Calude;Mathematical Structures in Computer Science,2009

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A computation model with automatic functions and relations as primitive operations;Theoretical Computer Science;2022-07

2. SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS;The Journal of Symbolic Logic;2021-08-12

3. Searching for shortest and least programs;Theoretical Computer Science;2020-02

4. Generic algorithms for halting problem and optimal machines revisited;Logical Methods in Computer Science;2016-04-05

5. Universality and Almost Decidability;Fundamenta Informaticae;2015