Recursive computational depth.
type: Item
instance of: scholarly article
title: Recursive computational depth.
zbMATH Open document ID: 1045.68569
author: James I. Lathrop
author: Jack H. Lutz
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1853068
MaRDI profile type: Publication
full work available at URL: inco.1999.2794
OpenAlex ID: W2026888287
cites work: Q4321931
cites work: Q3820592
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Weakly useful sequences
cites work: Q5592246
cites work: Computational depth and reducibility
cites work: Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
cites work: Q4070738
cites work: Q4337021
cites work: THE BANACH-MAZUR GAME
cites work: Category and Measure in Complexity Classes
cites work: Almost everywhere high nonuniform complexity
cites work: The definition of random sequences
cites work: Q5620774
cites work: Q5573961
cites work: Q3996430
cites work: A unified approach to the definition of random sequences
cites work: Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
cites work: Process complexity and effective random tests
cites work: A formal theory of inductive inference. Part II
cites work: Von Mises' definition of random sequences reconsidered
cites work: Q5284998
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
DOI: 10.1006/INCO.1999.2794
description: scientific article; zbMATH DE number 1853068