We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ. In other words. B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumberable degrees) and their relationship with the Turing degrees. Among other results we show that whenever α in not GL₂ the LR degree of (...) α bounds $2^{\aleph _{0}}$ degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees. (shrink)

The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky, and Weinberger on applications of computability to differential geometry. We study the sw-degrees of c.e. reals and construct a c.e. real which has no random c.e. real (i.e., Ω number) sw-above it.

A new approach for a uniform classification of the computably approximable real numbers is introduced. This is an important class of reals, consisting of the limits of computable sequences of rationals, and it coincides with the 0'-computable reals. Unlike some of the existing approaches, this applies uniformly to all reals in this class: to each computably approximable real x we assign a degree structure, the structure of all possible ways available to approximate x. So the main criterion for such classification (...) is the variety of the effective ways we have to approximate a real number. We exhibit extreme cases of such approximation structures and prove a number of related results. (shrink)

We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.

We say that A≤LRB if every B-random set is A-random with respect to Martin–Löf randomness. We study this relation and its interactions with Turing reducibility, classes, hyperimmunity and other recursion theoretic notions.

We show that the identity bounded Turing degrees of computably enumerable sets are not dense.

We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand, we know that there are intervals which contain no hypersimple set.

We prove a number of results in effective randomness, using methods in which Π⁰₁ classes play an essential role. The results proved include the fact that every PA Turing degree is the join of two random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.

A set $B\subseteq\mathbb{N}$ is called low for Martin-Löf random if every Martin-Löf random set is also Martin-Löf random relative to B . We show that a $\Delta^0_2$ set B is low for Martin-Löf random if and only if the class of oracles which compress less efficiently than B , namely, the class $\mathcal{C}^B=\{A\ |\ \forall n\ K^B(n)\leq^+ K^A(n)\}$ is countable (where K denotes the prefix-free complexity and $\leq^+$ denotes inequality modulo a constant. It follows that $\Delta^0_2$ is the largest arithmetical (...) class with this property and if $\mathcal{C}^B$ is uncountable, it contains a perfect $\Pi^0_1$ set of reals. The proof introduces a new method for constructing nontrivial reals below a $\Delta^0_2$ set which is not low for Martin-Löf random. (shrink)

Given two infinite binary sequences A,B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as much as the prefix-free Kolmogorov complexity relative to A, modulo a constant. This relation, introduced in Nies [14] and denoted by A≤LKB, is a measure of relative compressing power of oracles, in the same way that Turing reducibility is a measure of relative information. The equivalence classes (...) induced by ≤LK are called LK degrees and there is a least degree containing the oracles which can only compress as much as a computable oracle, also called the ‘low for K’ sets. A well-known result from Nies [14] states that these coincide with the K-trivial sets, which are the ones whose initial segments have minimal prefix-free Kolmogorov complexity. We show that with respect to ≤LK, given any non-trivial sets X,Y there is a computably enumerable set A which is not K-trivial and it is below X,Y. This shows that the local structures of and Turing degrees are not elementarily equivalent to the corresponding local structures in the LK degrees. It also shows that there is no pair of sets computable from the halting problem which forms a minimal pair in the LK degrees; this is sharp in terms of the jump, as it is known that there are sets computable from which form a minimal pair in the LK degrees. We also show that the structure of LK degrees below the LK degree of the halting problem is not elementarily equivalent to the or structures of LK degrees. The proofs introduce a new technique of permitting below a set that is not K-trivial, which is likely to have wider applications. (shrink)

We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper ideal in the c.e. Turing degrees has an incomplete upper bound. It follows that there is no prime ideal in the c.e. Turing degrees. This answers a question of Calhoun [2]. Every proper ideal in the c.e. Turing degrees has a low2 upper bound. Furthermore, the partial order of ideals under inclusion is dense.

TheK-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable members and has an exact pair below the degree of the halting problem. The question of whether it has an exact pair in the c.e. degrees was first raised in [22, Question 4.2] and later in [25, Problem 5.5.8].We give a negative answer to this question. In fact, we show the following stronger statement in the c.e. degrees. There exists aK-trivial degreedsuch that for all (...) degreesa, bwhich are notK-trivial anda > d, b > dthere exists a degreevwhich is notK-trivial anda > v, b > v. This work sheds light to the question of the definability of theK-trivial degrees in the c.e. degrees. (shrink)

We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. We also show that there is no maximal (w.r.t. ≤wtt) hypersimple wtt degree. Moreover, we consider the sets that are both hypersimple and semicomputable, characterize them as (...) the (bi-infinite) c.e. cuts of computable orderings of ℕ of order type ω+ω* and study their wtt degrees. We show that there are hypersimple degrees that are not bounded by any hypersimple semicomputable degree, investigate relationships with the join and look for maximal and minimal elements of related classes. (shrink)

We show that there is a strong minimal pair in the computably enumerable Turing degrees, i.e. a pair of nonzero c.e. degrees a and b such that a∩b = 0 and for any nonzero c.e. degree x ≤ a, b ∪ x ≥ a.

We show that there exists a real α such that, for all reals β, if α is linear reducible to β then β≤Tα. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no ℓ-complete Δ2 real. Upon realizing that quasi-maximality does not characterize the random reals–there exist reals which are not random but which are of quasi-maximal ℓ-degree–it is then natural to ask whether maximality could provide such a characterization. Such hopes, (...) however, are in vain since no real is of maximal ℓ-degree. (shrink)

We survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on reducibilities that measure the initial segment complexity of reals and the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.

We study Δ2 reals x in terms of how they can be approximated symmetrically by a computable sequence of rationals. We deal with a natural notion of ‘approximation representation’ and study how these are related computationally for a fixed x. This is a continuation of earlier work; it aims at a classification of Δ2 reals based on approximation and it turns out to be quite different than the existing ones (based on information content etc.).

We study the approximation properties of computably enumerable reals. We deal with a natural notion of approximation representation and study their wtt-degrees. Also, we show that a single representation may correspond to a quite diverse variety of reals.

We investigate notions of randomness in the space ${{\mathcal C}(2^{\mathbb N})}$ of continuous functions on ${2^{\mathbb N}}$ . A probability measure is given and a version of the Martin-Löf test for randomness is defined. Random ${\Delta^0_2}$ continuous functions exist, but no computable function can be random and no random function can map a computable real to a computable real. The image of a random continuous function is always a perfect set and hence uncountable. For any ${y \in 2^{\mathbb N}}$ , (...) there exists a random continuous function F with y in the image of F. Thus the image of a random continuous function need not be a random closed set. The set of zeroes of a random continuous function is always a random closed set. (shrink)

We extend the hierarchy defined in [5] to cover all hyperarithmetical reals. An intuitive idea is used or the definition, but a characterization of the related classes is obtained. A hierarchy theorem and two fixed point theorems are presented.

We study inversions of the jump operator on ${\mathrm{\Pi }}_{1}^{0}$ classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random. Both of the classes coincide with the degrees above 0′ which are not 0′-dominated. A (...) further application is the complete solution of [24, Problem 3.6.9]: one direction of van Lambalgen's theorem holds for weak 2-randomness, while the other fails. Finally we discuss various techniques for coding information into incomplete randoms. Using these techniques we give a negative answer to [24, Problem 8.2.14]: not all weakly 2-random sets are array computable. In fact, given any oracle X, there is a weakly 2-random which is not array computable relative to X. This contrasts with the fact that all 2-random sets are array computable. (shrink)

Let h : ℕ → ℚ be a computable function. A real number x is called h-monotonically computable if there is a computable sequence of rational numbers which converges to x h-monotonically in the sense that h|x – xn| ≥ |x – xm| for all n andm > n. In this paper we investigate classes h-MC of h-mc real numbers for different computable functions h. Especially, for computable functions h : ℕ → ℚ, we show that the class h-MC coincides (...) with the classes of computable and semi-computable real numbers if and only if Σi∈ℕ) = ∞and the sum Σi∈ℕ) is a computable real number, respectively. On the other hand, if h ≥ 1 and h converges to 1, then h-MC = SC no matter how fast h converges to 1. Furthermore, for any constant c > 1, if h is increasing and converges to c, then h-MC = c-MC. Finally, if h is monotone and unbounded, then h-MC contains all ω-mc real numbers which are g-mc for some computable function g. (shrink)

Review by: Johanna N. Y. Franklin The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 115-118, March 2013.

The spiritual geography of Russian cosmism. General characteristics ; Recent definitions of cosmism -- Forerunners of Russian cosmism. Vasily Nazarovich Karazin (1773-1842) ; Alexander Nikolaevich Radishchev (1749-1802) ; Poets: Mikhail Vasilyevich Lomonosov, (1711-1765) and Gavriila Romanovich Derzhavin (1743-1816) ; Prince Vladimir Fedorovich Odoevsky (1803-1869) ; Aleksander Vasilyevich Sukhovo-Kobylin (1817-1903) -- The Russian philosophical context. Philosophy as a passion ; The destiny of Russia ; Thought as a call for action ; The totalitarian cast of mind -- The religious and spiritual (...) context. The kingdom of god on earth ; Hesychasm: two great Russian saints ; The Third Rome ; Pre-Christian antecedents -- The Russian esoteric context. Early searches for "deep wisdom" ; Popular magic ; Higher magic in the time of Peter the Great ; Esotericism after Peter the Great ; Theosophy and anthroposophy -- Nikolai Fedorovich Fedorov (1829-1903), the philosopher of the common task ; The one idea ; The unacknowledged prince ; The village teacher ; First disciple: Dostoevsky and Tolstoy ; The Moscow librarian ; Last years: Askhabad: the only portrait -- The "common task" ; Esoteric dimensions of the "common task" ; Fedorov's legacy: projectivism, delo, regulation -- The religious cosmists. Vladimir Sergeevich Solovyov (1853-1900) ; Sergei Nikolaevich Bulgakov (1871-1944) ; Pavel Aleksandrovich Florensky (1882-1937) ; Nikolai Aleksandrovich Berdyaev (1874-1948) -- The scientific cosmists. Konstantin Edouardovich Tsiolkovsky (1857-1935) ; Vladimir Ivanovich Vernadsky (1863-1945) ; Alexander Leonidovich Chizhevsky (1897-1964) ; Vasily Feofilovich Kuprevich (1897-1969) -- Promethean theurgy. Life-creation ; Cultural immortalism ; God-building ; Re-aiming the arrows of Eros ; Technological utopianism ; Occultism -- Fedorov's twentieth century followers. Nikolai Pavlovich Peterson (1844-1919) and Vladimir Aleksandrovich Kozhevnikov (1852-1917) ; Svyatogor and the biocosmists ; New wine and the universal task ; Alexander Konstantinovich Gorsky (1886-1943) and Nikolai Alexandrovich Setnitsky (1888-1937) ; Valerian Nikolaevich Muravyov (1885-1932) ; Vasily Nikolaevich Chekrygin (1897-1922) -- Cosmism and its offshoots today. The N.F. Fedorov museum-library ; The Tsiolkovsky museum and Chizhevsky center ; ISRICA - Institute for Scientific Research in Cosmic Anthropoecology ; Lev Nikolaevich Gumilev (1912-1992) and neo-eurasianism ; The hyperboreans ; Scientific immortalism: Igor Vishev, Danila Medvedev ; Conclusions about the Russian cosmists. (shrink)

"Simone Weil's bibliography": p. [181]-194. Includes index. Introduction / George Abbott White -- The jagged edge / Michele Murray -- Simone Weil's mind / Robert Coles -- The life and death of Simone Weil / J.M. Cameron -- Simone Weil, last things / Michele Murray -- Simone Weil's Iliad / Michael K. Ferber -- Notes on Simone Weil's Iliad / Joseph H. Summers -- Patriotism and The need for roots / Conor Cruise O'Brien -- Marxism-Leninism and the language of (...) Politics magazine / Staughton Lynd -- Simone Weil's work experiences / George Abbott White. (shrink)

The persistent interpretation problem for quantum mechanics may indicate an unwillingness to consider unpalatable assumptions that could open the way toward progress. With this in mind, I focus on the work of David Bohm, whose earlier work has been more influential than that of his later. As I’ll discuss, I believe two assumptions play a strong role in explaining the disparity: 1) that theories in physics must be grounded in mathematical structure and 2) that consciousness must supervene on material processes. (...) I’ll argue that the first assumption appears to lead us toward Everett’s many worlds interpretation, which suggests a red flag. I’ll also argue that the second assumption is suspect due to the persistent explanatory gap for consciousness. Later, I explore ways that Bohm’s later work holds some promise in providing a better fit with our world, both phenomenologically and empirically. Also, I’ll address the possible problem of realism. (shrink)

touch 27 Thirrdly, the straining of the eye 28 The occasions which suggest distance have in their own nature no relation to it 29 A difficult case proposed by Dr. Barrow as repugnant to all the known theories 30 This case contradicts a ...

L’homme occidental est hanté par le deuil d’une origine qu’il ne cesse de vouloir comprendre à travers les mythes, les fables et les religions qui en constituent le récit. Si chaque peuple a son identité, sa manière de vivre, de penser et de sentir, l’homme est-il pour autant prisonnier de sa culture, identifié à ses valeurs, aliéné à ses représentations, assigné à ses croyances? Si toutes les cultures se valent sont-elles pour autant égales?Aujourd’hui, le débat sur l’identité traduit un malaise (...) dans la culture. Il s’agit de distinguer entre le pluralisme nécessaire à toute vie démocratique et un multiculturalisme qui peut en être la limite. L’effacement des repères symboliques, le décloisonnement des cultures, le brassage des populations ont favorisé l’émergence d’une identité cosmopolite, clanique. L’homme cosmopolite est un homme sans qualité, de toutes les mémoires mais d’aucune histoire, semblable aux autres mais ne ressemblant à personne. A l’inverse, et dans le même temps, les communautarismes revendiquent une identité inaltérable qui fait du Même l’organisateur du lien social, tandis que les fondamentalismes font des Ecritures le nouveau livre de sciences naturelles et de Dieu l’immense marché mondial des fanatismes. Une identité qui prétend à l’immuabilité ne menace pas seulement le corps social mais porte atteinte à l’idée même d’humanité. (shrink)