Mass problems and initial segment complexity
type: Item
instance of: scholarly article
zbMATH Open document ID: 1337.03061
author: W. M. Phillip Hudelson
publication date: 2014-09-30T00:00:00Z
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6349645
zbMATH Keywords: partial randomness
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: Martin-Löf randomness
zbMATH Keywords: effective Hausdorff dimension
MaRDI profile type: Publication
full work available at URL: jsl.2013.7
OpenAlex ID: W2076298969
cites work: Mass Problems and Measure-Theoretic Regularity
cites work: A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
cites work: Mass Problems and Randomness
cites work: A fixed-point-free minimal degree
cites work: Kolmogorov complexity and the Recursion Theorem
cites work: Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
cites work: Diagonally non-recursive functions and effective Hausdorff dimension
cites work: Algorithmic Randomness and Complexity
cites work: An introduction to Kolmogorov complexity and its applications
cites work: On partial randomness
cites work: Comparing DNR and WWKL
cites work: Relations between varieties of kolmogorov complexities
cites work: An extension of the recursively enumerable Turing degrees
DOI: 10.1017/JSL.2013.7
title: Mass problems and initial segment complexity
published in: The Journal of Symbolic Logic
description: scientific article; zbMATH DE number 6349645