Displaying similar documents to “Kolmogorov complexity and probability measures”

Kolmogorov complexity, pseudorandom generators and statistical models testing

Jan Šindelář, Pavel Boček (2002)

Kybernetika

Similarity:

An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a probability measure is stated in the paper. Both generating and testing of such strings is considered. Kolmogorov complexity theory is used as a tool. Classes of strings “typical” for a given probability measure are introduced. It is shown that no pseudorandom generator can produce long strings from the classes. The time complexity of pseudorandom generators with oracles capable to recognize “typical”...

Alternative definitions of conditional possibilistic measures

Ivan Kramosil (1998)

Kybernetika

Similarity:

The aim of this paper is to survey and discuss, very briefly, some ways how to introduce, within the framework of possibilistic measures, a notion analogous to that of conditional probability measure in probability theory. The adjective “analogous” in the last sentence is to mean that the conditional possibilistic measures should play the role of a mathematical tool to actualize one’s degrees of beliefs expressed by an a priori possibilistic measure, having obtained some further information...