Closed left-r.e. sets (Q2964277): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q324251
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Frank Stephan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompleteness theorems for random reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lattice of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem of Tarski / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicity of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohesive sets and recursively enumerable Dedekind cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Things that can be made into themselves / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3233/com-160054 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2301081474 / rank
 
Normal rank

Latest revision as of 11:03, 30 July 2024

scientific article
Language Label Description Also known as
English
Closed left-r.e. sets
scientific article

    Statements

    Closed left-r.e. sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    left-r.e. sets
    0 references
    reducibilities
    0 references
    Kolmogorov complexity
    0 references
    cohesive sets
    0 references
    weakly 1-generic sets
    0 references
    0 references