Lowness and logical depth
type: Item
instance of: scholarly article
title: Lowness and logical depth
zbMATH Open document ID: 1418.03150
author: Michael McInerney
author: Keng Meng Ng
author: Rodney G. Downey
published in: Theoretical Computer Science
publication date: 2017-11-06T00:00:00Z
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 6803103
zbMATH Keywords: depth
zbMATH Keywords: Bennett depth
zbMATH Keywords: lowness
zbMATH Keywords: computability
zbMATH Keywords: computably enumerable degrees
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.08.010
OpenAlex ID: W2745592874
cites work: Computational depth: Concept and applications
cites work: Depth as randomness deficiency
cites work: Q3820592
cites work: Feasible Depth
cites work: Algorithmic Randomness and Complexity
cites work: Time-bounded Kolmogorov complexity and Solovay functions
cites work: Lowness for the class of random sets
cites work: Recursive computational depth.
cites work: An introduction to Kolmogorov complexity and its applications
cites work: On the polynomial depth of various sets of random strings
cites work: Depth, Highness and DNR Degrees
cites work: Lowness properties and randomness
cites work: Q3611832
cites work: Q4040892
DOI: 10.1016/J.TCS.2017.08.010
description: scientific article; zbMATH DE number 6803103