Closed Left-R.E. Sets

DOI10.1007/978-3-642-20877-5_23zbMath1333.03108OpenAlexW1581290130MaRDI QIDQ3010403

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)

Related Items (1)

Selection by Recursively Enumerable Sets

Cites Work

• Unnamed Item
• Incompleteness theorems for random reals
• Classical recursion theory. The theory of functions and sets of natural numbers
• Cohesive sets and recursively enumerable Dedekind cuts
• Algorithmic Randomness and Complexity
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• On the Lattice of Recursively Enumerable Sets
• Computability and Randomness
• Simplicity of recursively enumerable sets
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Recursively enumerable sets of positive integers and their decision problems
• Solution of a problem of Tarski
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Closed Left-R.E. Sets