AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (Q4579816): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Rodney G. Downey / rank
Normal rank
 
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/jsl.2017.78 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885724903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Strong Dimension in Algorithmic Information and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive dimension and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of reals of positive effective packing dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective packing dimension and traceability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dimensions of individual strings and sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective fractal dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kolmogorov complexity characterization of constructive Hausdorff dimension. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic dynamics: entropy = dimension = complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling effective packing dimension of \(\Delta_2^0\) degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two definitions of fractional dimension / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 07:52, 16 July 2024

scientific article; zbMATH DE number 6915722
Language Label Description Also known as
English
AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES
scientific article; zbMATH DE number 6915722

    Statements

    AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (English)
    0 references
    0 references
    0 references
    10 August 2018
    0 references
    Kolmogorov complexity
    0 references
    effective packing dimension
    0 references
    array noncomputability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references