823 research outputs found

    Computable de Finetti measures

    Full text link
    We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we prove that a distribution on the unit interval is computable if and only if its moments are uniformly computable.Comment: 32 pages. Final journal version; expanded somewhat, with minor corrections. To appear in Annals of Pure and Applied Logic. Extended abstract appeared in Proceedings of CiE '09, LNCS 5635, pp. 218-23

    Computability of probability measures and Martin-Lof randomness over metric spaces

    Get PDF
    In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show that any computable metric space with a computable probability measure is isomorphic to the Cantor space in a computable and measure-theoretic sense. We show that any computable metric space admits a universal uniform randomness test (without further assumption).Comment: 29 page

    Computability and analysis: the legacy of Alan Turing

    Full text link
    We discuss the legacy of Alan Turing and his impact on computability and analysis.Comment: 49 page

    Independence, Relative Randomness, and PA Degrees

    Full text link
    We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability measures, too. We study, for a given real AA, the \emph{independence spectrum} of AA, the set of all BB so that there exists a probability measure μ\mu so that μ{A,B}=0\mu\{A,B\} = 0 and (A,B)(A,B) is μ×μ\mu\times\mu-random. We prove that if AA is r.e., then no Δ20\Delta^0_2 set is in the independence spectrum of AA. We obtain applications of this fact to PA degrees. In particular, we show that if AA is r.e.\ and PP is of PA degree so that P̸≥TAP \not\geq_{T} A, then A⊕P≥T0′A \oplus P \geq_{T} 0'
    • …
    corecore