Closed left-r.e. sets
From MaRDI portal
Publication:2964277
Recommendations
Cites work
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Classical recursion theory. The theory of functions and sets of natural numbers
- Classical recursion theory. Vol. II
- 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
- Semirecursive Sets and Positive Reducibility
- 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
- Things that can be made into themselves
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
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 Q2964277)