Limit-depth and DNR degrees
type: Item
instance of: scholarly article
title: Limit-depth and DNR degrees
zbMATH Open document ID: 1476.03059
author: Philippe Moser
author: Frank Stephan
published in: Information Processing Letters
publication date: 2018-04-05T00:00:00Z
full work available at URL: PM computer science limit depth.pdf
Mathematics Subject Classification ID: 03D32
Mathematics Subject Classification ID: 03D28
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6856066
zbMATH Keywords: theory of computation
zbMATH Keywords: logical depth
zbMATH Keywords: Kolmogorov complexity
MaRDI profile type: Publication
OpenAlex ID: W2789971377
cites work: Q3820592
cites work: Algorithmic Randomness and Complexity
cites work: Lowness and logical depth
cites work: Kolmogorov complexity and the Recursion Theorem
cites work: Computational depth and reducibility
cites work: On the polynomial depth of various sets of random strings
cites work: Depth, Highness and DNR Degrees
cites work: Q3611832
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
DOI: 10.1016/J.IPL.2018.02.015
Recommended article: Depth, Highness and DNR Degrees
Recommended article: Q4560220
Recommended article: Feasible Depth
Recommended article: Censored depth quantiles
Recommended article: Filter depth of complexes
Recommended article: The depth, the delooping level and the finitistic dimension
Recommended article: Q3097353
Recommended article: Regression Depth
Recommended article: Relativized depth
Recommended article: Enclosing depth and other depth measures
description: scientific article; zbMATH DE number 6856066