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.

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 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 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 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)

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 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 (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 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.

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)

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)

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

The topic of a priori knowledge is approached through the theory of evidence. A shortcoming in traditional formulations of moderate rationalism and moderate empiricism is that they fail to explain why rational intuition and phenomenal experience count as basic sources of evidence. This explanatory gap is filled by modal reliabilism -- the theory that there is a qualified modal tie between basic sources of evidence and the truth. This tie to the truth is then explained by the theory of concept (...) possession: this tie is a consequence of what, by definition, it is to possess (i.e., to understand) one’s concepts. A corollary of the overall account is that the a priori disciplines (logic, mathematics, philosophy) can be largely autonomous from the empirical sciences. (shrink)

Idealist philosopher Georg Hegel defied the traditional epistemological distinction of objective from subjective and developed his own dialectical alternative. Remarkable for its breadth and profundity, this work combines aspects of psychology, logic, moral philosophy, and history to form a comprehensive view that encompasses all forms of civilization. Its three divisions consist of the subjective mind (dealing with anthropology and psychology), the objective mind (concerning philosophical issues of law and morals), and the absolute mind (covering fine arts, religion, and philosophy). Wide-ranging (...) in its influence, this survey of the evolution of consciousness is essential reading for all students of philosophy and history. (shrink)

TRANSLATORS PREFACE THE PRESENT TRANSLATION OF GEORG SIMMEL'S Schopen- hauer und Nietzsche: Ein Vortragszyklus (1907), ...

"This book is a sorely needed corrective. Animal Spirits is an important--maybe even a decisive--contribution at a difficult juncture in macroeconomic theory.

Functionalism would be mistaken if there existed a system of deviant relations (an “anti-mind”) that had the same functional roles as the standard mental relations. In this paper such a system is constructed, using “Quinean transformations” of the sort associated with Quine’s thesis of the indeterminacy of translation. For example, a mapping m from particularistic propositions (e.g., that there exists a rabbit) to universalistic propositions (that rabbithood is manifested). Using m, a deviant relation thinking* is defined: x thinks* p iff (...) x thinks m(p). Such deviant relations satisfy the commonly discussed functionalist psychological principles. Finally, a more complicated system of deviant relations is constructed, one satisfying sophisticated principles dealing with the self-conscious rational mind. (shrink)

Physics underlies all complexity, including our own existence: how is this possible? How can our own lives emerge from interactions of electrons, protons, and neutrons? This book considers the interaction of physical and non-physical causation in complex systems such as living beings, and in particular in the human brain, relating this to the emergence of higher levels of complexity with real causal powers. In particular it explores the idea of top-down causation, which is the key effect allowing the emergence of (...) true complexity and also enables the causal efficacy of non-physical entities, including the value of money, social conventions, and ethical choices. (shrink)

The description for this book, Desert, will be forthcoming.

George Berkeley (1685-1753) is the superstar of Irish Philosophy. He entered Trinity College, Dublin, in 1700 and became a fellow in 1707. In 1724 he resigned his Fellowship to become Dean of Derry, and in 1734 he was made Bishop of Cloyne. He settled in Oxford in 1752 and died the following year. The work of George Berkeley is marked by its diversity and range. His writings take in such topics as mathematics, psychology, politics, health, economics, deism and (...) education, as well as that with which he is most associated - philosophy. Whatever topic he dealt with, his grasp of the subject matter was always impressive and his criticisms of his contemporaries often acute. Among the most noteable of the British Empiricists, he took his starting point from Locke's new 'way of ideas', but he rejected abstract ideas and the possibility of real existence outside perception. It is for this doctrine that he is most known - that there is no such thing as matter, and that things are collections of ideas which can exist only in our minds and only for so long as they are perceived. This philosophy, summed up in his phrase 'to be is to be perceived', he termed 'immaterialism'. A.C. Fraser's collection includes a series of what were previously unpublished notes by Berkeley on all the main topics of his philosophy. This, the 1901 edition, was the first complete edition of his works. (shrink)

Philosophy of mind has made substantial progress on biologically-rooted approaches to understanding the mind and subjectivity through the enactivist perspective, but research on subjectivity within neuroscience has not kept apace. Indeed, we possess no principled means of relating experiential phenomena to neurophysiological processes. Here, we present the Nested States Model as a framework to guide empirical investigation into the relationship between subjectivity and neurobiology. Building on recent work in phenomenology and philosophy of mind, we develop an account of experiential states (...) as layered, or nested. We argue that this nested structure is also apparent in brain activity. The recognition of this structural homology — that both experiential and brain states can be characterized as systems of nested states — brings our views of subjective mental states into broad alignment with our understanding of general principles and properties of brain activity. This alignment enables a more systematic approach to formulating specific hypotheses and predictions about how the two domains relate to one another. (shrink)

Georges Sorel's Study on Vico is a revelatory document of the depths and stakes of French social thought at the end of the 19th century. What brought Sorel to the 18th century Neapolitan theorist of history? Acute awareness of the limitations of Marxist thought in his day, a profound concern with the material underpinnings of language, law, and culture, and the imperative to understand the possibilities of revolutionary change. We find here a different Sorel, one who speaks in surprising ways (...) to the 21st century. The translation is accompanied by an introduction and by a set of notes which situate the text both in Sorel's overall intellectual trajectory and in the fin de siècle debates from which it emerged. (shrink)

This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be (...) preserved, reproduced, and made generally available to the public. To ensure a quality reading experience, this work has been proofread and republished using a format that seamlessly blends the original graphical elements with text in an easy-to-read typeface. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

Many epistemologists have been interested in justification because of its presumed close relationship to knowledge. This relationship is intended to be ...

How do we evaluate the power and utility of language when it has been made to articulate falsehoods in certain totalitarian regimes or has been charged with vulgarity and imprecision in a mass-consumer democracy? How will language react to the increasingly urgent claims of more exact speech such as mathematics and symbolic notation? These are some of the questions Steiner addresses in this elegantly written book, first published in 1967 to international acclaim.