Closed left-r.e. sets

DOI10.1007/978-3-642-20877-5_23MaRDI QIDQ3010403zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Jason Teutsch, Frank Stephan

Publication date 1 July 2011

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-20877-5_23

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Closed left-r.e. sets
• A cohesive set which is not high
• scientific article; zbMATH DE number 4023250
• scientific article; zbMATH DE number 3954889
• Publication:4729771

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• Algorithmic randomness and complexity.
• An introduction to Kolmogorov complexity and its applications
• Classical recursion theory. The theory of functions and sets of natural numbers
• Cohesive sets and recursively enumerable Dedekind cuts
• Computability and Randomness
• Incompleteness theorems for random reals
• On the Lattice of Recursively Enumerable Sets
• Recursively enumerable sets of positive integers and their decision problems
• Simplicity of recursively enumerable sets
• Solution of a problem of Tarski
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(2)

• Closed left-r.e. sets
• Selection by recursively enumerable sets

This page was built for publication: Closed left-r.e. sets

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