A Safe Approximation for Kolmogorov Complexity

Cite

Text

Bloem et al. "A Safe Approximation for Kolmogorov Complexity." International Conference on Algorithmic Learning Theory, 2014. doi:10.1007/978-3-319-11662-4_24

Markdown

[Bloem et al. "A Safe Approximation for Kolmogorov Complexity." International Conference on Algorithmic Learning Theory, 2014.](https://mlanthology.org/alt/2014/bloem2014alt-safe/) doi:10.1007/978-3-319-11662-4_24

BibTeX

@inproceedings{bloem2014alt-safe,
  title     = {{A Safe Approximation for Kolmogorov Complexity}},
  author    = {Bloem, Peter and Mota, Francisco and de Rooij, Steven and Antunes, Luis and Adriaans, Pieter},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2014},
  pages     = {336-350},
  doi       = {10.1007/978-3-319-11662-4_24},
  url       = {https://mlanthology.org/alt/2014/bloem2014alt-safe/}
}