Results 1  10
of
67
Probability: Theory and examples
 CAMBRIDGE U PRESS
, 2011
"... Some times the lights are shining on me. Other times I can barely see. Lately it occurs to me what a long strange trip its been. Grateful Dead In 1989 when the first edition of the book was completed, my sons David and Greg were 3 and 1, and the cover picture showed the Dow Jones at 2650. The last t ..."
Abstract

Cited by 799 (10 self)
 Add to MetaCart
Some times the lights are shining on me. Other times I can barely see. Lately it occurs to me what a long strange trip its been. Grateful Dead In 1989 when the first edition of the book was completed, my sons David and Greg were 3 and 1, and the cover picture showed the Dow Jones at 2650. The last twenty years have brought many changes but the song remains the same. The title of the book indicates that as we develop the theory, we will focus our attention on examples. Hoping that the book would be a useful reference for people who apply probability in their work, we have tried to emphasize the results that are important for applications, and illustrated their use with roughly 200 examples. Probability is not a spectator sport, so the book contains almost 450 exercises to challenge the reader and to deepen their understanding. The fourth edition has two major changes (in addition to a new publisher): (i) The book has been converted from TeX to LaTeX. The systematic use of labels should eventually eliminate problems with references to other points in the text. In
Algorithmic information theory
 IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1977
"... This paper reviews algorithmic information theory, which is an attempt to apply informationtheoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that ..."
Abstract

Cited by 320 (19 self)
 Add to MetaCart
This paper reviews algorithmic information theory, which is an attempt to apply informationtheoretic and probabilistic ideas to recursive function theory. Typical concerns in this approach are, for example, the number of bits of information required to specify an algorithm, or the probability that a program whose bits are chosen by coin flipping produces a given output. During the past few years the definitions of algorithmic information theory have been reformulated. The basic features of the new formalism are presented here and certain results of R. M. Solovay are reported.
An oracle builder’s toolkit
, 2002
"... We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and ..."
Abstract

Cited by 47 (10 self)
 Add to MetaCart
We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and infer several strong collapses relative to SPgenerics; 3. we show that under additional assumptions these collapses also occur relative to Cohen generics; 4. we show that relative to SPgenerics, ULIN ∩ coULIN ̸ ⊆ DTIME(n k) for any k, where ULIN is unambiguous linear time, despite the fact that UP ∪ (NP ∩ coNP) ⊆ P relative to these generics; 5. we show that there is an oracle relative to which NP/1∩coNP/1 ̸ ⊆ (NP∩coNP)/poly; and 6. we use a specialized notion of genericity to create an oracle relative to which NP BPP ̸ ⊇ MA.
Degrees of random sets
, 1991
"... An explicit recursiontheoretic definition of a random sequence or random set of natural numbers was given by MartinLöf in 1966. Other approaches leading to the notions of nrandomness and weak nrandomness have been presented by Solovay, Chaitin, and Kurtz. We investigate the properties of nrando ..."
Abstract

Cited by 46 (4 self)
 Add to MetaCart
An explicit recursiontheoretic definition of a random sequence or random set of natural numbers was given by MartinLöf in 1966. Other approaches leading to the notions of nrandomness and weak nrandomness have been presented by Solovay, Chaitin, and Kurtz. We investigate the properties of nrandom and weakly nrandom sequences with an emphasis on the structure of their Turing degrees. After an introduction and summary, in Chapter II we present several equivalent definitions of nrandomness and weak nrandomness including a new definition in terms of a forcing relation analogous to the characterization of ngeneric sequences in terms of Cohen forcing. We also prove that, as conjectured by Kurtz, weak nrandomness is indeed strictly weaker than nrandomness. Chapter III is concerned with intrinsic properties of nrandom sequences. The main results are that an (n + 1)random sequence A satisfies the condition A (n) ≡T A⊕0 (n) (strengthening a result due originally to Sacks) and that nrandom sequences satisfy a number of strong independence properties, e.g., if A ⊕ B is nrandom then A is nrandom relative to B. It follows that any countable distributive lattice can be embedded
Tarski's System of Geometry
 Bulletin of Symbolic Logic
, 1999
"... . This paper is an edited form of a letter written by the two authors (in the name of Tarski) to Wolfram Schwabh auser around 1978. It contains extended remarks about Tarski's system of foundations for Euclidean geometry, in particular its distinctive features, its historical evolution, the histo ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
. This paper is an edited form of a letter written by the two authors (in the name of Tarski) to Wolfram Schwabh auser around 1978. It contains extended remarks about Tarski's system of foundations for Euclidean geometry, in particular its distinctive features, its historical evolution, the history of specific axioms, the questions of independence of axioms and primitive notions, and versions of the system suitable for the development of 1dimensional geometry. In his 192627 lectures at the University of Warsaw, Alfred Tarski gave an axiomatic development of elementary Euclidean geometry, the part of plane Euclidean geometry that is not based upon settheoretical notions, or, in other words, the part that can be developed within the framework of firstorder logic. He proved, around 1930, that his system of geometry admits elimination of quantifiers: every formula is provably equivalent (on the basis of the axioms) to a Boolean combination of basic formulas. From this theorem he...
A ZeroOne Law for Dynamical Properties
 In Topological dynamics and applications (Minneapolis, MN
, 1995
"... . For any countable group \Gamma satisfying the "weak Rohlin property", and for each dynamical property, the set of \Gammaactions with that property is either residual or meager. The class of groups with the weak Rohlin property includes each lattice Z \Thetad ; indeed, all countable discrete a ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
. For any countable group \Gamma satisfying the "weak Rohlin property", and for each dynamical property, the set of \Gammaactions with that property is either residual or meager. The class of groups with the weak Rohlin property includes each lattice Z \Thetad ; indeed, all countable discrete amenable groups. For \Gamma an arbitrary countable group, let A be the set of \Gammaactions on the unit circle Y . We establish an Equivalence theorem by showing that a dynamical property is Baire/meager/residual in A if and only if it is Baire/meager/residual in the set of shiftinvariant measures on the product space Y \Theta\Gamma . x1 Introduction Halmos's book Ergodic Theory introduced many of us to the study of determining which dynamical properties are generic (i.e, topologically residual) in the socalled "coarse topology" on transformations. For instance, "weakmixing" is generic, whereas "mixing" is not, [Hal, pp. 77,78]. The exploration of this notion of genericity became a...
Forcing axioms and projective sets of reals
 Proceedings of Foundations of the Formal Sciences III, in: “Classical and new paradigms of computation and their complexity hierarchies” (Löwe
"... Abstract. This paper is an introduction to forcing axioms and large cardinals. Specifically, we shall discuss the large cardinal strength of forcing axioms in the presence of regularity properties for projective sets of reals. The new result shown in this paper says that ZFC + the bounded proper for ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. This paper is an introduction to forcing axioms and large cardinals. Specifically, we shall discuss the large cardinal strength of forcing axioms in the presence of regularity properties for projective sets of reals. The new result shown in this paper says that ZFC + the bounded proper forcing axiom (BPFA) + “every projective set of reals is Lebesgue measurable ” is equiconsistent with ZFC + “there is a Σ1 reflecting cardinal above a remarkable cardinal.” 1. Introduction. The current paper ∗ is in the tradition of the following result.
Survey of the Steinhaus tiling problem
, 2003
"... We survey some results and problems arising from a classic problem of Steinhaus: Is there a subset S of R² such that each isometric copy of Z² (the lattice points in the plane) meets S in exactly one point. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We survey some results and problems arising from a classic problem of Steinhaus: Is there a subset S of R² such that each isometric copy of Z² (the lattice points in the plane) meets S in exactly one point.