B. Bauwens

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5874320	2023-02-07	Paper
Inequalities for space-bounded Kolmogorov complexity	2023-01-12	Paper
The Normalized Algorithmic Information Distance Can Not Be Approximated	2022-10-19	Paper
Uniform van Lambalgen's theorem fails for computable randomness	2020-03-12	Paper
The normalized algorithmic information distance can not be approximated	2020-02-16	Paper
Short lists with short programs in short time	2018-04-18	Paper
Conditional probabilities and van Lambalgen's theorem revisited	2018-02-01	Paper
Sophistication vs logical depth	2017-03-31	Paper
Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness	2017-03-31	Paper
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits	2017-03-03	Paper
Relating and contrasting plain and prefix Kolmogorov complexity	2016-05-19	Paper
Van Lambalgen's theorem fails for some computable measure	2015-09-09	Paper
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs	2015-09-01	Paper
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity	2014-09-30	Paper
Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity	2013-08-12	Paper
An additivity theorem for plain Kolmogorov complexity	2013-04-15	Paper
Notes on sum-tests and independence tests	2011-03-30	Paper
Influence tests I: ideal composite hypothesis tests, and causal semimeasures	2009-12-14	Paper

This page was built for person: B. Bauwens