Constructive dimension and Turing degrees (Q733739)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Constructive dimension and Turing degrees	scientific article

Statements

scholarly article

Constructive dimension and Turing degrees (English)

zbMATH Open document ID

10.1007/s00224-009-9170-1

Laurent Bienvenu

Theory of Computing Systems

publication date

19 October 2009

full work available at URL

https://arxiv.org/abs/cs/0701089

Mathematics Subject Classification ID

zbMATH DE Number

zbMATH Keywords

constructive dimension

Turing

extractor

degree

randomness

MaRDI profile type

MaRDI publication profile

Effective Strong Dimension in Algorithmic Information and Computational Complexity

Constructive Dimension and Weak Truth-Table Degrees

Logical Approaches to Computational Barriers

Dimension extractors and optimal decompression

Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws

Reducibility and Completeness for Sets of Integers

Dimension in Complexity Classes

The dimensions of individual strings and sequences

Effective fractal dimensions

A Kolmogorov complexity characterization of constructive Hausdorff dimension.

Classical recursion theory. The theory of functions and sets of natural numbers

Recursively enumerable sets of positive integers and their decision problems

Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity

Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups

Two definitions of fractional dimension

Systems of Logic Based on Ordinals<sup>†</sup>

Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences

Sitelinks

Mathematics(1 entry)

mardi Publication:733739

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q733739&oldid=35132181"