Results 1 
3 of
3
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
Beyond Gödel's Theorem: Turing Nonrigidity Revisited
 In Logic Colloquium ’95
, 1998
"... xperience, but simply as irreducible points comparable, epistemologically, to the gods of Homer.") Of course, the theory itself does indicate di#culties in substantiating the Turing model, but, if not overstretched (viz. the ubiquitous Godel's [15], [16] Theorem) such asymptotic representations can ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
xperience, but simply as irreducible points comparable, epistemologically, to the gods of Homer.") Of course, the theory itself does indicate di#culties in substantiating the Turing model, but, if not overstretched (viz. the ubiquitous Godel's [15], [16] Theorem) such asymptotic representations can be useful and productive adjuncts to subjective intuition. For instance, unlike in mathematics where small variations in axioms can lead to fundamentally di#erent theories, Turing nonrigidity and known countable automorphism bases indicate that although diverse basic assumptions about the real world, related to culture or religion, for example, are inevitable (perhaps even necessary), relative to the Turing model there is a convergence at higher levels of the informational structure suggested by relative rigidity of substructures. The purpose of this note is to describe how, at a more basic level, the material Universe can be modelled according to the underlying structure of
Open Problems in Reverse Mathematics
, 1999
"... The basic reference for reverse mathematics is my recently published book Subsystems of Second Order Arithmetic [32]. The web site for the book is www.math.psu.edu/simpson/sosoa/. This article is a writeup of some representative open problems in reverse mathematics. It was originally a handout ..."
Abstract
 Add to MetaCart
The basic reference for reverse mathematics is my recently published book Subsystems of Second Order Arithmetic [32]. The web site for the book is www.math.psu.edu/simpson/sosoa/. This article is a writeup of some representative open problems in reverse mathematics. It was originally a handout