scientific article; zbMATH DE number 5264766
From MaRDI portal
Publication:5458618
zbMath1140.68407MaRDI QIDQ5458618
Publication date: 16 April 2008
Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2007/7786/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kolmogorov complexitylownessLebesgue measurecomputable randomnesscomputably enumerablerandom realsbounded machinesbounded tests
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Applications of computability and recursion theory (03D80)
Related Items (1)
This page was built for publication: