Closed left-r.e. sets

DOI10.3233/COM-160054MaRDI QIDQ2964277zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Jason Teutsch, Frank Stephan

Publication date 23 February 2017

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-160054

zbMATH Keywords

Kolmogorov complexitycohesive setsreducibilitiesleft-r.e. setsweakly 1-generic sets

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Closed left-r.e. sets
• Universal computably enumerable sets and initial segment prefix-free complexity
• Algorithmic Randomness of Closed Sets
• scientific article; zbMATH DE number 3954889
• Arithmetic complexity via effective names for random sequences

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

Cited in

(2)

• Reducibility by means of almost polynomial functions
• Closed left-r.e. 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 Q2964277)