Selection by recursively enumerable sets

DOI10.1007/978-3-642-38236-9_14MaRDI QIDQ4922122zbMATH OpenOpenAlexFDO

Authors Wolfgang Merkle, Jason Teutsch, Wei Wang, 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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32)

Recommendations

• scientific article; zbMATH DE number 1929969
• A random set which only computes strongly jump-traceable c.e. sets
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• On the construction of effectively random sets
• Computations with oracles: Generalized selection

Cites work

• An introduction to Kolmogorov complexity and its applications
• Arithmetic complexity via effective names for random sequences
• Chaitin numbers, Solovay machines, and Gödel incompleteness.
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Closed left-r.e. sets
• Computability and randomness
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• Recursively enumerable sets of positive integers and their decision problems
• The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
• 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
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(4)

• Things that can be made into themselves
• scientific article; zbMATH DE number 4200186 (Why is no real title available?)
• scientific article; zbMATH DE number 1285474 (Why is no real title available?)
• Almost combinatorial selector sets

This page was built for publication: Selection by recursively enumerable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922122)