Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures)

Vladik Kreinovich, Luc Longpré. Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures). SIGACT News, 36(3):107-112, 2005. [doi]

@article{KreinovichL05,
  title = {Kolmogorov complexity leads to a representation theorem for idempotent probabilities (sigma-maxitive measures)},
  author = {Vladik Kreinovich and Luc Longpré},
  year = {2005},
  doi = {10.1145/1086649.1086650},
  url = {http://doi.acm.org/10.1145/1086649.1086650},
  tags = {Kolmogorov complexity},
  researchr = {https://researchr.org/publication/KreinovichL05},
  cites = {0},
  citedby = {0},
  journal = {SIGACT News},
  volume = {36},
  number = {3},
  pages = {107-112},
}