scientific article; zbMATH DE number 6991620

zbMath1435.03074arXiv1511.05027MaRDI QIDQ4560220

Philippe Moser, Frank Stephan

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1511.05027

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Kolmogorov complexityBennett logical depthalgorithmic randomness theorycomputability and randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Algorithmic randomness and dimension (03D32)

Related Items (5)

Pushdown and Lempel-Ziv depth ⋮ Relativized depth ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Searching for shortest and least programs ⋮ Polylog depth, highness and lowness for E

This page was built for publication: