Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
Crossref DOI link: https://doi.org/10.1007/s00153-015-0430-2
Published Online: 2015-05-01
Published Print: 2015-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bauwens, Bruno https://orcid.org/0000-0002-6138-0591
Text and Data Mining valid from 2015-05-01
