Related papers: On a Crucial Problem in Probabilities and Solution
The question concerning the physical realizability of a probability distribution is of quite importance in Quantum foundations. Specker first pointed out that this question cannot be answered from Kolmogorov's axioms alone. Lately, this…
We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…
Algorithmic statistics has two different (and almost orthogonal) motivations. From the philosophical point of view, it tries to formalize how the statistics works and why some statistical models are better than others. After this notion of…
The computational method of parametric probability analysis is introduced. It is demonstrated how to embed logical formulas from the propositional calculus into parametric probability networks, thereby enabling sound reasoning about the…
Here we present in a single essay a combination and completion of the several aspects of the problem of randomness of individual objects which of necessity occur scattered in our texbook "An Introduction to Kolmogorov Complexity and Its…
The true process that generated data cannot be determined when multiple explanations are possible. Prediction requires a model of the probability that a process, chosen randomly from the set of candidate explanations, generates some future…
"Information Processing" is a recently launched buzzword whose meaning is vague and obscure even for the majority of its users. The reason for this is the lack of a suitable definition for the term "information". In my attempt to amend this…
This talk is organized as follows: First we explain some basic concepts in non-commutative probability theory in the frame of operator algebras. In Section 2, we discuss related topics in von Neumann algebras. Sections 3 and 4 contain some…
Probability theory is far from being the most general mathematical theory of uncertainty. A number of arguments point at its inability to describe second-order ('Knightian') uncertainty. In response, a wide array of theories of uncertainty…
A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), asserts the hardness of ruling out length $t$ proofs that string $x$ is Kolmogorov random (e.g. $x{\in}R$), by analogy to Chaitin's result that proving $x{\in}R$ is…
Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instead seek a short list of candidates which includes a laconic…
Though the ability of human beings to deal with probabilities has been put into question, the assessment of rarity is a crucial competence underlying much of human decision-making and is pervasive in spontaneous narrative behaviour. This…
The Kolmogorov complexity function K can be relativized using any oracle A, and most properties of K remain true for relativized versions. In section 1 we provide an explanation for this observation by giving a game-theoretic interpretation…
Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
In 1933 Kolmogorov constructed a general theory that defines the modern concept of conditional probability. In 1955 Renyi fomulated a new axiomatic theory for probability motivated by the need to include unbounded measures. This note…
Quantum systems are the ultimate touchstone for the production of random sequences of numbers. Spatially spread entangled systems allow the generation of identical random sequences in remote locations. The impossibility of observing a…
We develop an analogue of probability theory for probabilities taking values in topological groups. We generalize Kolmogorov's method of axiomatization of probability theory: main distinguishing features of frequency probabilities are taken…