Selection by Recursively Enumerable Sets
From MaRDI portal
Publication:4922122
DOI10.1007/978-3-642-38236-9_14zbMath1382.03067OpenAlexW24007878MaRDI QIDQ4922122
Wei Wang, Jason Teutsch, Wolfgang Merkle, Yue Yang, Frank Stephan
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_14
Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)
Cites Work
- Unnamed Item
- Unnamed Item
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness.
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Arithmetic complexity via effective names for random sequences
- Closed Left-R.E. Sets
- Kolmogorov complexity and the Recursion Theorem
- The axiomatization of randomness
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- Recursively enumerable sets of positive integers and their decision problems
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Selection by Recursively Enumerable Sets