On relativizing Kolmogorov's absolute probability functions.
نویسندگان
چکیده
منابع مشابه
On Relativizing Kolmogorov's Absolute Probability Functions
Let 5 be a Boolean algebra; let Π be a set of relative (= conditional) probability functions on S, and IT a set of absolute ones; and let V be A Π A, with A here an arbitrary but fixed member of S. (i) A function P' in IT is then the V-restriction of a function P in Π (= P has P' as its K-restriction) if V(A) = P(,4, V) for each A in S; and (ii) the functions in Π relativize those in IT if each...
متن کاملRelativizing Chaitin’s Halting Probability
As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U . Let ΩU be the halting probability of U A; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω . It is this operator which is our primary object of study. We can...
متن کاملProbability generating functions of absolute difference of two random variables.
Communicated by Jerzy Neyman, August 1, 1966 1. All random variables considered in this note are nonnegative and integervalued. Generically, the probability generating functions (P. G. F.) of such variables are denoted by G with subscripts identifying the random variables concerned. The argument, or arguments of the P. G. F., denoted by either u or v, will be assumed to have their moduli less t...
متن کاملRelativizing Relativity
In what follows, we shall study two signal types with two different signal velocities generating two different sets of Lorentz frames associated with two types of ``light'' cones. (A generalization to an arbitrary number of signals is straightforward.) This may seem implausible and even misleading at first, since from two different ``maximal'' signal velocities only one can be truly maximal. On...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1989
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635234