scientific article

zbMATH Open1210.68062MaRDI QIDQ3076855

Rupert Hölzl

Publication date: 25 February 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

traceabilitycomputational depthSolovay functionsKummer's gap theoremnon-monotonic randomnessjump-traceableKolmogorov complexity without time boundsMartin-Loef randomnessrandomness classestime bounded Kolmogorov complexity

Mathematics Subject Classification ID

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

Related Items (7)

Kolmogorov complexity arguments in combinatorics ⋮ Title not available (Why is that?) ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Construction of expanders and superconcentrators using Kolmogorov complexity ⋮ Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity ⋮ Kolmogorov's contributions to information theory and algorithmic complexity ⋮ Kolmogorov complexity and non-determinism

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076855)