scholarly journals COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS

2016 ◽  
Vol 81 (3) ◽  
pp. 1028-1046 ◽  
Author(s):  
DENIS R. HIRSCHFELDT ◽  
CARL G. JOCKUSCH ◽  
RUTGER KUYPER ◽  
PAUL E. SCHUPP
Keyword(s):  
Main Tool ◽  
The Other ◽  
Compactness Theorem ◽  
Random Sets ◽  
Symmetric Difference ◽  
Turing Degrees ◽  
Algorithmic Randomness ◽  
Random Set ◽  
Natural Embedding ◽  
Image Position

AbstractA coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense. We show that if A is 1-random and B is computable from every coarse description D of A, then B is K-trivial, which implies that if A is in fact weakly 2-random then B is computable. Our main tool is a kind of compactness theorem for cone-avoiding descriptions, which also allows us to prove the same result for 1-genericity in place of weak 2-randomness. In the other direction, we show that if $A \le _{{\rm{T}}} \emptyset {\rm{'}}$ is a 1-random set, then there is a noncomputable c.e. set computable from every coarse description of A, but that not all K-trivial sets are computable from every coarse description of some 1-random set. We study both uniform and nonuniform notions of coarse reducibility. A set Y is uniformly coarsely reducible to X if there is a Turing functional Φ such that if D is a coarse description of X, then ΦD is a coarse description of Y. A set B is nonuniformly coarsely reducible to A if every coarse description of A computes a coarse description of B. We show that a certain natural embedding of the Turing degrees into the coarse degrees (both uniform and nonuniform) is not surjective. We also show that if two sets are mutually weakly 3-random, then their coarse degrees form a minimal pair, in both the uniform and nonuniform cases, but that the same is not true of every pair of relatively 2-random sets, at least in the nonuniform coarse degrees.

scholarly journals Randomness, relativization and Turing degrees

2005 ◽  
Vol 70 (2) ◽  
pp. 515-535 ◽  
Author(s):  
André Nies ◽  
Frank Stephan ◽  
Sebastiaan A. Terwijn
Keyword(s):  
Random Sets ◽  
Turing Degrees ◽  
Algorithmic Randomness ◽  
Schnorr Randomness ◽  
Minimal Pairs ◽  
High Degree

AbstractWe compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅(n − 1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) ≥ ∣x∣ − c. The ‘only if’ direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity.Next we prove some results on lowness. Among other things, we characterize the 2-random sets as those l-random sets that are low for Chaitin's Ω. Also, 2-random sets form minimal pairs with 2-generic sets. The r.e. low for Ω. sets coincide with the r.e. K-trivial ones.Finally we show that the notions of Martin-Löf randomness, recursive randomness, and Schnorr randomness can be separated in every high degree while the same notions coincide in every non-high degree. We make some remarks about hyperimmune-free and PA-complete degrees.

Random sets for the pointwise ergodic theorem

1992 ◽  
Vol 12 (1) ◽  
pp. 85-94 ◽  
Author(s):  
Yenkun Huang
Keyword(s):  
Ergodic Theorem ◽  
The Other ◽  
Random Sets ◽  
Simple Condition ◽  
Random Set ◽  
Large Classes ◽  
Pointwise Ergodic Theorem ◽  
Other Hand ◽  
Density Zero ◽  
Banach Density

AbstractWe generalize a result of Bourgain and devise more general criteria which guarantee that the corresponding random set in Z+ almost surely satisfies a pointwise ergodic theorem on Lp for p > 1. Several large classes of examples are constructed. We also show that under a simple condition the corresponding random set in Z+ almost surely satisfies a pointwise ergodic theorem not only on Lp for p > 1 but also on L1. On the other hand, we establish a criterion to conclude that a certain class of random sets have Banach density zero. In particular, all of the examples mentioned have Banach density zero.

scholarly journals Topics in Algorithmic Randomness and Computability Theory

2021 ◽  
Author(s):  
◽  
Michael McInerney
Keyword(s):  
Binary Sequence ◽  
Computability Theory ◽  
Binary Sequences ◽  
Random Sets ◽  
Turing Degrees ◽  
Algorithmic Randomness ◽  
Computational Power ◽  
Definition Of ◽  
Compare And Contrast

<p>This thesis establishes results in several different areas of computability theory.  The first chapter is concerned with algorithmic randomness. A well-known approach to the definition of a random infinite binary sequence is via effective betting strategies. A betting strategy is called integer-valued if it can bet only in integer amounts. We consider integer-valued random sets, which are infinite binary sequences such that no effective integer-valued betting strategy wins arbitrarily much money betting on the bits of the sequence. This is a notion that is much weaker than those normally considered in algorithmic randomness. It is sufficiently weak to allow interesting interactions with topics from classical computability theory, such as genericity and the computably enumerable degrees. We investigate the computational power of the integer-valued random sets in terms of standard notions from computability theory.  In the second chapter we extend the technique of forcing with bushy trees. We use this to construct an increasing ѡ-sequence 〈an〉 of Turing degrees which forms an initial segment of the Turing degrees, and such that each an₊₁ is diagonally noncomputable relative to an. This shows that the DNR₀ principle of reverse mathematics does not imply the existence of Turing incomparable degrees.   In the final chapter, we introduce a new notion of genericity which we call ѡ-change genericity. This lies in between the well-studied notions of 1- and 2-genericity. We give several results about the computational power required to compute these generics, as well as other results which compare and contrast their behaviour with that of 1-generics.</p>

scholarly journals Topics in Algorithmic Randomness and Computability Theory

2021 ◽  
Author(s):  
◽  
Michael McInerney
Keyword(s):  
Binary Sequence ◽  
Computability Theory ◽  
Binary Sequences ◽  
Random Sets ◽  
Turing Degrees ◽  
Algorithmic Randomness ◽  
Computational Power ◽  
Definition Of ◽  
Compare And Contrast

<p>This thesis establishes results in several different areas of computability theory.  The first chapter is concerned with algorithmic randomness. A well-known approach to the definition of a random infinite binary sequence is via effective betting strategies. A betting strategy is called integer-valued if it can bet only in integer amounts. We consider integer-valued random sets, which are infinite binary sequences such that no effective integer-valued betting strategy wins arbitrarily much money betting on the bits of the sequence. This is a notion that is much weaker than those normally considered in algorithmic randomness. It is sufficiently weak to allow interesting interactions with topics from classical computability theory, such as genericity and the computably enumerable degrees. We investigate the computational power of the integer-valued random sets in terms of standard notions from computability theory.  In the second chapter we extend the technique of forcing with bushy trees. We use this to construct an increasing ѡ-sequence 〈an〉 of Turing degrees which forms an initial segment of the Turing degrees, and such that each an₊₁ is diagonally noncomputable relative to an. This shows that the DNR₀ principle of reverse mathematics does not imply the existence of Turing incomparable degrees.   In the final chapter, we introduce a new notion of genericity which we call ѡ-change genericity. This lies in between the well-studied notions of 1- and 2-genericity. We give several results about the computational power required to compute these generics, as well as other results which compare and contrast their behaviour with that of 1-generics.</p>

scholarly journals The Dissociation of the Compound of Iodine and Thio-urea

1904 ◽  
Vol 24 ◽  
pp. 233-239 ◽  
Author(s):  
Hugh Marshall
Keyword(s):  
Nitric Acid ◽  
General Formula ◽  
Free Acid ◽  
The Other ◽  
Image Position

When thio-urea is treated with suitable oxidising agents in presence of acids, salts are formed corresponding to the general formula (CSN2H4)2X2:—Of these salts the di-nitrate is very sparingly soluble, and is precipitated on the addition of nitric acid or a nitrate to solutions of the other salts. The salts, as a class, are not very stable, and their solutions decompose, especially on warming, with formation of sulphur, thio-urea, cyanamide, and free acid. A corresponding decomposition results immediately on the addition of alkali, and this constitutes a very characteristic reaction for these salts.

Extremely undecidable sentences

1982 ◽  
Vol 47 (1) ◽  
pp. 191-196 ◽  
Author(s):  
George Boolos
Keyword(s):  
Modal Logic ◽  
The Other ◽  
Propositional Modal Logic ◽  
Image Position

Let ‘ϕ’, ‘χ’, and ‘ψ’ be variables ranging over functions from the sentence letters P0, P1, … Pn, … of (propositional) modal logic to sentences of P(eano) Arithmetic), and for each sentence A of modal logic, inductively define Aϕ by[and similarly for other nonmodal propositional connectives]; andwhere Bew(x) is the standard provability predicate for PA and ⌈F⌉ is the PA numeral for the Gödel number of the formula F of PA. Then for any ϕ, (−□⊥)ϕ = −Bew(⌈⊥⌉), which is the consistency assertion for PA; a sentence S is undecidable in PA iff both and , where ϕ(p0) = S. If ψ(p0) is the undecidable sentence constructed by Gödel, then ⊬PA (−□⊥→ −□p0 & − □ − p0)ψ and ⊢PA(P0 ↔ −□⊥)ψ. However, if ψ(p0) is the undecidable sentence constructed by Rosser, then the situation is the other way around: ⊬PA(P0 ↔ −□⊥)ψ and ⊢PA (−□⊥→ −□−p0 & −□−p0)ψ. We call a sentence S of PA extremely undecidable if for all modal sentences A containing no sentence letter other than p0, if for some ψ, ⊬PAAψ, then ⊬PAAϕ, where ϕ(p0) = S. (So, roughly speaking, a sentence is extremely undecidable if it can be proved to have only those modal-logically characterizable properties that every sentence can be proved to have.) Thus extremely undecidable sentences are undecidable, but neither the Godel nor the Rosser sentence is extremely undecidable. It will follow at once from the main theorem of this paper that there are infinitely many inequivalent extremely undecidable sentences.

On functional Nörlund methods

1970 ◽  
Vol 67 (1) ◽  
pp. 47-60 ◽  
Author(s):  
B. Choudhary
Keyword(s):  
The Other ◽  
Integral Transformations ◽  
Other Hand ◽  
Nörlund Means ◽  
The One ◽  
Image Position

Integral transformations analogous to the Nörlund means have been introduced and investigated by Kuttner, Knopp and Vanderburg(6), (5), (4). It is known that with any regular Nörlund mean (N, p) there is associated a functionregular for |z| < 1, and if we have two Nörlund means (N, p) and (N, r), where (N, pr is regular, while the function is regular for |z| ≤ 1 and different) from zero at z = 1, then q(z) = r(z)p(z) belongs to a regular Nörlund mean (N, q). Concerning Nörlund means Peyerimhoff(7) and Miesner (3) have recently obtained the relation between the convergence fields of the Nörlund means (N, p) and (N, r) on the one hand and the convergence field of the Nörlund mean (N, q) on the other hand.

scholarly journals Distribution of rational points on the real line

1973 ◽  
Vol 15 (2) ◽  
pp. 243-256 ◽  
Author(s):  
T. K. Sheng
Keyword(s):  
Algebraic Number ◽  
Rational Number ◽  
Real Line ◽  
Rational Points ◽  
The Other ◽  
Liouville Numbers ◽  
The Real ◽  
Other Hand ◽  
Image Position

It is well known that no rational number is approximable to order higher than 1. Roth [3] showed that an algebraic number is not approximable to order greater than 2. On the other hand it is easy to construct numbers, the Liouville numbers, which are approximable to any order (see [2], p. 162). We are led to the question, “Let Nn(α, β) denote the number of distinct rational points with denominators ≦ n contained in an interval (α, β). What is the behaviour of Nn(α, + 1/n) as α varies on the real line?” We shall prove that and that there are “compressions” and “rarefactions” of rational points on the real line.

3. Laboratory Notes by Professor Tait (a.) Measurement of the Potential, required to produce Sparks of various lengths, in Air at different pressures, by a Holtz Machine

1878 ◽  
Vol 9 ◽  
pp. 332-333
Author(s):  
Messrs Macfarlane ◽  
Paton
Keyword(s):  
General Result ◽  
The Other ◽  
Considerable Distance ◽  
Image Position

The general result of these strictly preliminary experiments appears to show that for sparks not exceeding a decimetre in length (L), taken in air at different pressures (P), between two metal balls of 7mm·5 radius, the requisite potential (V), is expressed by the formulaThe Holtz machine employed is a double one, made by Ruhmkorff, and it was used with its small Leyden jars attached. The measurements had to be made with a divided-ring electrometer, so that two insulated balls, at a considerable distance from one another, were connected, one with the machine, the other with the electrometer.

scholarly journals Certain Mathematical Instruments for Graphically Indicating the Direction of Refracted and Reflected Light Rays

1906 ◽  
Vol 25 (2) ◽  
pp. 806-812
Author(s):  
J.R. Milne
Keyword(s):  
Optical System ◽  
The Other ◽  
Reflected Light ◽  
Light Rays ◽  
Image Position

The refraction equation sin i == μ sin r, though simple in itself, is apt to give rise, in problems connected with refraction, to formulæ too involved for arithmetical computation. In such cases it may be necessary to trace the course through the optical system in question of a certain number of arbitrarily chosen rays, and thence to find the course of the other rays by interpolation. Thelinkage about to be described affords a rapid and accurate means of determining the paths of the rays through any optical system.

Sign in / Sign up

Export Citation Format

Share Document