Let ≤r and ≤sbe two binary relations on 2ℕ which are meant as reducibilities. Let both relations be closed under finite variation and consider the uniform distribution on 2ℕ, which is obtained by choosing elements of 2ℕ by independent tosses of a fair coin.Then we might ask for the probability that the lower ≤r-cone of a randomly chosen set X, that is, the class of all sets A with A ≤rX, differs from the lower ≤s-cone of X. By c osure (...) under finite variation, the Kolmogorov 0-1 aw yields immediately that this probability is either 0 or 1; in case it is 1, the relations are said to be separable by random oracles.Again by closure under finite variation, for every given set A, the probability that a randomly chosen set X is in the upper ≤r-cone of A is either 0 or 1; let Almostr be the class of sets for which the upper ≤r-cone has measure 1. In the following, results about separations by random oracles and about Almost classes are obtained in the context of generalized reducibilities, that is, for binary relations on 2ℕ which can be defined by a countable set of total continuous functionals on 2ℕ in the same way as the usual resource-bounded reducibilities are defined by an enumeration of appropriate oracle Turing machines. The concept of generalized reducibility comprises a natura resource-bounded reducibilities, but is more general; in particular, it does not involve any kind of specific machine model or even effectivity. The results on generalized reducibilities yield corollaries about specific resource-bounded reducibilities, including several results which have been shown previously in the setting of time or space bounded Turing machine computations. (shrink)

We prove two sets of results concerning computational complexity classes. First, we propose a new variation of the random oracle hypothesis, originally posed by Bennett and Gill after they showed that relative to a randomly chosen oracle, with probability 1. Their original hypothesis was quickly disproven in several ways, most famously in 1992 with the result that, in spite of the classes being shown unequal with probability 1. Here we propose a variation of what it means to be “large” (...) using the Ellentuck topology. In this new context, we demonstrate that the set of oracles separating and is not small, and obtain similar results for the separation of from along with the separation of from. We also show that the set of oracles equating with is large in this new sense. We demonstrate that this version of the hypothesis provides a sufficient condition for unrelativized relationships, at least in the cases considered here. Second, we examine the descriptive complexity of the classes of oracles providing the separations for these various classes, and determine their exact placement in the Borel hierarchy. (shrink)

The relativized propositional calculus is a system of Boolean formulas with query symbols. A formula in this system is called a one-query formula if the number of occurrences of query symbols is just one. If a one-query formula is a tautology with respect to a given oracle A then it is called a one-query tautology with respect to A. By extending works of Ambos-Spies (1986) and us (2002), we investigate the measure of the class of all oracles A such (...) that the set of all one-query tautologies with respect to A does not p-btt-reduce to A, where p-btt denotes polynomial-time bounded-truth-table. We show that certain Dowd-type generic oracles all belong to the class, and hence measure of the class is one. (shrink)

The feasible interpolation theorem for semantic derivations from [J. Krajíček, Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, J. Symbolic Logic 62 457–486] allows to derive from some short semantic derivations of the disjointness of two [Formula: see text] sets [Formula: see text] and [Formula: see text] a small communication protocol computing the Karchmer–Wigderson multi-function [Formula: see text] associated with the sets, and such a protocol further yields a small circuit separating [Formula: see text] from (...) [Formula: see text]. When [Formula: see text] is closed upwards, the protocol computes the monotone Karchmer–Wigderson multi-function [Formula: see text] and the resulting circuit is monotone. Krajíček [Interpolation by a game, Math. Logic Quart. 44 450–458] extended the feasible interpolation theorem to a larger class of semantic derivations using the notion of a real communication complexity. In this paper, we generalize the method to a still larger class of semantic derivations by allowing randomized protocols. We also introduce an extension of the monotone circuit model, monotone circuits with a local oracle, that does correspond to communication protocols for [Formula: see text] making errors. The new randomized feasible interpolation thus shows that a short semantic derivation of the disjointness of [Formula: see text], [Formula: see text] closed upwards, yields a small randomized protocol for [Formula: see text] and hence a small monotone CLO separating the two sets. This research is motivated by the open problem to establish a lower bound for proof system [Formula: see text] operating with clauses formed by linear Boolean functions over [Formula: see text]. The new randomized feasible interpolation applies to this proof system and also to cutting planes CP, to small width resolution over CP of Krajíček [Discretely ordered modules as a first-order extension of the cutting planes proof system, J. Symbolic Logic 63 1582–1596] ) and to random resolution RR of Buss, Kolodziejczyk and Thapen [Fragments of approximate counting, J. Symbolic Logic 79 496–525]. The method does not yield yet lengths-of-proofs lower bounds; for this it is necessary to establish lower bounds for randomized protocols or for monotone CLOs. (shrink)

Extending techniques of Dowd and those of Poizat, we study computational complexity of in the case when is a generic oracle, where is a positive integer, and denotes the collection of all -query tautologies with respect to an oracle . We introduce the notion of ceiling-generic oracles, as a generalization of Dowd's notion of -generic oracles to arbitrary finitely testable arithmetical predicates. We study how existence of ceiling-generic oracles affects behavior of a generic oracle, by which we (...) show that is not a subset of is comeager in the Cantor space. Moreover, using ceiling-generic oracles, we present an alternative proof of the fact (Dowd) that the class of all -generic oracles has Lebesgue measure zero. (shrink)

A puzzle of an unmarked clock, used by Timothy Williamson to question the KK principle, was separately adapted by David Christensen and Adam Elga to critique a principle of Rational Reflection. Both authors, we argue, flout the received relationship between ideal agency and the classical distinction between systematic and random error, namely that ideal agents are subject only to the latter. As a result, these criticisms miss their mark.

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence and every 2-random sequence forms a minimal pair in the Turing degrees with every 2-generic sequence. We strengthen these results by showing that every Demuth random sequence computes a 1-generic sequence and that every Demuth random sequence forms a minimal pair with every pb-generic sequence. (...) Moreover, we prove that for every comeager${\cal G} \subseteq {2^\omega }$, there is some weakly 2-random sequenceXthat computes some$Y \in {\cal G}$, a result that allows us to provide a fairly complete classification as to how various notions of effective randomness interact in the Turing degrees with various notions of effective genericity. (shrink)

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P is strongly reducible to Q if every member of Q Turing computes a member of P via a fixed Turing functional. The weak degrees and strong degrees are the equivalence classes of mass problems under weak and strong reducibility, respectively. (...) We focus on the countable distributive lattices P w and P s of weak and strong degrees of mass problems given by nonempty Π 1 0 subsets of 2 ω . Using an abstract Gödel/Rosser incompleteness property, we characterize the Π 1 0 subsets of 2 ω whose associated mass problems are of top degree in P w and P s , respectively. Let R be the set of Turing oracles which are random in the sense of Martin-Löf, and let r be the weak degree of R. We show that r is a natural intermediate degree within P w . Namely, we characterize r as the unique largest weak degree of a Π 1 0 subset of 2 ω of positive measure. Within P w we show that r is meet irreducible, does not join to 1, and is incomparable with all weak degrees of nonempty thin perfect Π 1 0 subsets of 2 ω . In addition, we present other natural examples of intermediate degrees in P w . We relate these examples to reverse mathematics, computational complexity, and Gentzen-style proof theory. (shrink)

Why don't we see large macroscopic objects in entangled states? Even if the particles composing the object were all entangled and insulated from the environment, we shall still find it almost always impossible to observe the superposition. The reason is that as the number of particles n grows, we need an ever more careful preparation, and an ever more carefully designed experiment, in order to recognize the entangled character of the state of the object. An observable W that distinguishes all (...) the unentangled states from some entangled states is called a witness. We consider witnesses on n quantum bits (qbits), and use the following normalization: A witness W satisfies |tr(Wr)|<= 1 for all separable states r, while ||W|| >1, with the norm being the maximum among the absolute values of the eigenvalues of W. Although there are n-qbit witnesses whose norm is exponential in n, we conjecture that for a large majority of such witnesses ||W||<=O[(nlogn)^1/2]. We prove this conjecture for the family of extremal witnesses introduced by Werner and Wolf (Phys. Rev. A 64, 032112 (2001)). Assuming the conjecture is valid we argue that multiparticle entanglement can be detected only if a system has been carefully prepared in a very special state. Otherwise, multiparticle entanglement lies below the threshold of detection, even if it exists, and even if decoherence has been ``turned off''. (shrink)

We investigate the role of continuous reductions and continuous relativization in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with respect to van Lambalgen’s theorem and the Miller–Yu/Levin theorem. We study lowness for continuous relativization of randomness, and show the equivalence of the higher analogues of the different characterizations of lowness for Martin-Löf randomness. We also characterize computing higher [Formula: see text]-trivial sets by higher (...) random sequences. We give a separation between higher notions of randomness, in particular between higher weak 2-randomness and [Formula: see text]-randomness. To do so we investigate classes of functions computable from Kleene’s [Formula: see text] based on strong forms of the higher limit lemma. (shrink)

Certain enterprises at the fringes of science, such as intelligent design creationism, claim to identify phenomena that go beyond not just our present physics but any possible physical explanation. Asking what it would take for such a claim to succeed, we introduce a version of physicalism that formulates the proposition that all available data sets are best explained by combinations of “chance and necessity”—algorithmic rules and randomness. Physicalism would then be violated by the existence of oracles that produce certain (...) kinds of noncomputable functions. Examining how a candidate for such an oracle would be evaluated leads to questions that do not admit an easy resolution. Since we lack any plausible candidate for any such oracle, however, chance-and-necessity physicalism appears very likely to be correct. (shrink)

Recall that B is PA relative to A if B computes a member of every nonempty $\Pi ^0_1(A)$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] introduced the notion of a $\Pi ^0_1$ class relative to an enumeration oracle A, which they called a $\Pi ^0_1{\left \langle {A}\right \rangle }$ class. We study the induced extension of the relation B is PA relative (...) to A to enumeration oracles and hence enumeration degrees. We isolate several classes of enumeration degrees based on their behavior with respect to this relation: the PA bounded degrees, the degrees that have a universal class, the low for PA degrees, and the ${\left \langle {\text {self}\kern1pt}\right \rangle }$ -PA degrees. We study the relationship between these classes and other known classes of enumeration degrees. We also investigate a group of classes of enumeration degrees that were introduced by Kalimullin and Puzarenko [14] based on properties that are commonly studied in descriptive set theory. As part of this investigation, we give characterizations of three of their classes in terms of a special sub-collection of relativized $\Pi ^0_1$ classes—the separating classes. These three can then be seen to be direct analogues of three of our classes. We completely determine the relative position of all classes in question. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Religion and Philosophy from Plato's Phaedo to the Chaldaean Oracles PHILIP MERLAN A FEW YEARSAGO another of the so-called Orphic tablets was found? Like the previously known ones~it is an instruction for the deceased--it tells him what he will find in the beyond and how he is to act to secure for himself a blessed afterlife. As a rule the tablets differ somewhat in their wording and the (...) newly found is particularly remarkable in that the deceased, when asked by the guards of the Spring of Memory what his business here is, is instructed to answer, "I am a child of the Earth and o~octvo~5~aveOo~v~og ~ and my name is Asterios. ''~ Now, it is generally recognized that the tablets are the product of some mystery religion? The new tablet suggests that part of its initiation ceremony might have been the experience of a mock death and a mock rebirth, the latter symbolized by the assuming of a new name? XN. M. Verdelis, "XaXr~ 7eCp6~oxos raX~rls ~x r 'ApxaLoXoy~K ~ 'Er 1950-1951 (Athens, 1951), pp. 80-105, esp. pp. 99-105. 2 Their text can be found in any edition of Diels-Kranz, VS. New finds: N. M. Verdelis, '0pr162 ~,&rt*ara ~ Kpr "Ap~ca~oXo*t~x~"E~tzep~ 1953-54, Second Part (Athens, 1958), pp. 56-60. On their character (Orphic? Pythagorean?), see F. Cumont, Lex perpetua (Paris, 1944), p. 406. Which mystery religion professed these two as obviously the highest deities? One is tempted to think of the mysteries of Samothrace, as in them these two deities played a conspicuous role according to Varro, De lingua lat. V 58 (cf. B. Cardauns, Varros 'Logistoricus' iiber die G6tterverehrung [Wiirzburg, 1960], pp. 60-67). 4 dar (~po4pro~)seems to me an evident conjecture by Verdelis. See, e.g., M. P. Nilsson, Geschichte der griechischen Religion, Vol. 2 (Miinchen, 1950), pp. 223-227. 0This is the assumption of Verdelis, XaXxr ~'e,~0~oxo~ with which I agree. On baptismal names see, e.g., A Oepke, "AM~IOAAEIY~ im griechischen und hellenistischen Kult," Archiv fiir Religionswissenschaft 31 (1934), pp. 42-56, esp. 52, note 5 (den Anstoss---scil. to bestowing of a new name on the initiate--gaben wohl primitive Wiedergeburtsgedanken). It seems to me that the Pindaric lines praising him who descends to the netherworld if he had been initiated, because he ot~e ~p fllov.reXew'gu,/olSeJ,~b.&6a~orol,tlpx~p (fr. 137a Sch) are to be explained by assuming that Pindar is here alluding to the experience of mock death (~-~,ev~-~) and mock rebirth (apX~), though it remains unclear whether the initiate experienced them in his own person or was only shown something (e.g. the burial of a seed followed by its shooting into an ear) symbolizing such events. [163] 164 HISTORY OF PHILOSOPHY And it is only natural to suppose that the initiation ceremony was preceded by some kind of ritual purification. In one more respect the new tablet is remarkable. It is the oldest we know. It belongs to the mid-fourth century. And this means that perhaps only a few years separate it from the date of the publication of Plato's Phaedo.' Now, as everybody knows, the Phaedo has something to say on mystery religions. Socrates first explains to his friends why he is not only not afraid of death but even looking forward to it. All his life long, he says, he was a philosopher and philosophy, as he sees it, is nothing else but ~X~-c~l0ctvd,ov. And as he explains in what way philosophy is a preparation for death, he time and again uses for the description of the philosopher's way of life the word 'pure' and its cognates (Phaedo 67d-e; 69a6-e5 [~d~}aqot~,•, ~xa0a0~vog], so that in the end the philosopher's way of life can by Socrates be described as purification-obviously purification not in its ritual sense of the word but, as Socrates sees it, in its true sense. And now Socrates clinches his argument and says: And it seems indeed that the men to whom we are indebted for the institution of... (shrink)

An examination of oracles in popular forms of Cuban espiritismo invites a rethinking of the role of “randomness” and “context” in the anthropology of divination. Through an analysis of the ways by which spirit mediums develop as persons, and their implications for the mechanics of divination, I argue that among espiritistas the meaning of particular configurations cannot be separated from the event that brings them about. Relatively simple in their properties (e.g. water), spiritist oracles function to provide impulse (...) to a perceived metaphysical universe that requires the generation of movement in order to achieve instantiation. The argument is that this movement provides a background of chaos essential to the purpose of divination. To demonstrate this, I forward an analogy to the language of electronic voice phenomena in parapsychology, in particular with its concept of “noise.” In both EVP and espiritismo, “noise” is the substance that allows spirits to communicate. (shrink)

We introduce the CUBISM system for the analysis and deep understanding of multi-participant dialogues. CUBISM brings together two typically separate forms of discourse analysis: semantic analysis and sociolinguistic analysis. In the paper proper, we describe and illustrate major components of the CUBISM system, and discuss the challenge posed by the system’s ultimate purpose, which is to automatically detect anomalous changes in participants’ expressed or implied beliefs about the world and each other, including shifts toward or away from cultural and community (...) norms. (shrink)

This essay explores the place in Clarice Lispector’s literature that seeks to touch a primary ground of the living with a language that exceeds the symbolic in order to read it from an anthropocenic, posthuman, and feminist present. It argues that the story “A menor mulher do mundo” (Laços de família, 1960) takes to an extreme what happens in all of Lispector’s literature at the point that we can find in Macabéa’s character from A hora da estrela (1976), a sort (...) of continuation of the smallest woman in the world. In both – the story and the novel – materiality comes to life and it is associated with a neutral background that goes beyond the difference between the human and the nonhuman, the feminine and the masculine, and that coincides with language, with the word. Both characters are residue and resistance, and operate in the stories in the same way that the word operates in Lispector’s writing. The Deleuzian concept of minor and its continuation on the concept of immanence are therefore read not only as a way to think beyond the species, but also as that which operates by destabilizing the concept of “woman” as a universal. Lispector’s writing, then, allows us to separate contemporary feminisms from an affirmation of the identity of the feminine and the masculine, to take them instead into an order that – regardless of whether embodied in woman – is outside the patriarchal. (shrink)

We introduce the CUBISM system for the analysis and deep understanding of multi-participant dialogues. CUBISM brings together two typically separate forms of discourse analysis: semantic analysis and sociolinguistic analysis. In the paper proper, we describe and illustrate major components of the CUBISM system, and discuss the challenge posed by the system’s ultimate purpose, which is to automatically detect anomalous changes in participants’ expressed or implied beliefs about the world and each other, including shifts toward or away from cultural and community (...) norms. (shrink)

We consider the following problem for various infinite-time machines. If a real is computable relative to a large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent of ZFC for ordinal Turing machines with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider infinite-time Turing machines, unresetting (...) and resetting infinite-time register machines, and α-Turing machines for countable admissible ordinals α. (shrink)

In this study, the well-known CES-D depression scale was considered as a prototypical tool for assessing an individual’s inclination to respond at random. It was postulated that the set of the responses obtained from the participants of a questionnaire survey could be divided into three classes: the honest responses class; the pure random class, characterized by the same prob- ability of each admissible score; the smart random class, characterized by the same distribution of the probability of scores (...) as in the honest responses class. A two-step classifying procedure was recommended. According to this procedure, the first step should be to separate the pure random responses from the others. As needed, at the second step the smart random responses should be separated from the honest responses. The CES-D scale consists of sixteen direct questions and four reverse questions, each question with four admissible score values, 0, 1, 2, or 3. The material for the analyses includes all of the 4 294 967 296 possible arrangements of the four scores for the sixteen direct questions, and all of the 256 arrangements of the four scores for the four reverse questions, and all of the possible 49 · 13 = 637 pairs of the possible values of the mean scores from the sixteen direct questions and from the four reverse questions, respectively. It was assumed, without loss of generality, that the honest responses to the sixteen direct questions lead to the resulting distribution: P = (8/16; 5/16; 2/16; 1/16), for a score equal to 0, 1, 2, or 3, respectively. The original iterative procedure was used to compute the exact distributions of the mean scores in the pure random class, and in the smart random class. The discriminant ability to dis- tinguish between the two classes was characterized with the Receiver Operating Characteristic (ROC) curve. In result, the excellent discriminant properties of the CES-D were confirmed. The area under the ROC curve was estimated equal to AUC = 0.98 with standard error SE = 0.004 for the screening of the pure random responses from all of the others, and equal to AUC = 0.87 with standard error SE = 0.006 for the purpose of distinguishing the smart random responses from the honest ones. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 03, December 2022. We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory [math] of [E. Jeřábek, Approximate counting by hashing in bounded arithmetic, J. Symb. Log. 74(3) (2009) 829–860]. In particular, the Ramsey and weak pigeonhole search problems lie in the new class. We give a purely computational (...) characterization of this class and show that, relative to an oracle, it does not contain the problem CPLS, a strengthening of PLS. As CPLS is provably total in the theory [math], this shows that [math] does not prove every [math] sentence which is provable in bounded arithmetic. This answers the question posed in [S. Buss, L. A. Kołodziejczyk and N. Thapen, Fragments of approximate counting, J. Symb. Log. 79(2) (2014) 496–525] and represents some progress in the program of separating the levels of the bounded arithmetic hierarchy by low-complexity sentences. Our main technical tool is an extension of the “fixing lemma” from [P. Pudlák and N. Thapen, Random resolution refutations, Comput. Complexity, 28(2) (2019) 185–239], a form of switching lemma, which we use to show that a random partial oracle from a certain distribution will, with high probability, determine an entire computation of a [math] oracle machine. The introduction to the paper is intended to make the statements and context of the results accessible to someone unfamiliar with NP search problems or with bounded arithmetic. (shrink)

In our former works, for a given concept of reduction, we study the following hypothesis: “For a random oracle A, with probability one, the degree of the one-query tautologies with respect to A is strictly higher than the degree of A.” In our former works (Suzuki in Kobe J. Math. 15, 91–102, 1998; in Inf. Comput. 176, 66–87, 2002; in Arch. Math. Logic 44, 751–762), the following three results are shown: The hypothesis for p-T (polynomial-time Turing) reduction is equivalent (...) to the assertion that the probabilistic complexity class R is not equal to NP; The hypothesis for p-tt (polynomial-time truth-table) reduction implies that P is not NP; The hypothesis holds for each of the following: disjunctive reduction, conjunctive reduction, and p-btt (polynomial-time bounded-truth-table) reduction. In this paper, we show the following three results: (1) Let c be a positive real number. We consider a concept of truth-table reduction whose norm is at most c times size of input, where for a relativized propositional formula F, the size of F denotes the total number of occurrences of propositional variables, constants and propositional connectives. Then, our main result is that the hypothesis holds for such tt-reduction, provided that c is small enough. How small c can we take so that the above holds? It depends on our syntactic convention on one-query tautologies. In our setting, the statement holds for all c < 1. (2) The hypothesis holds for monotone truth-table reduction (also called positive reduction). (3) Dowd (in Inf. Comput. 96, 65–76, 1992) shows a polynomial upper bound for the minimum sizes of forcing conditions associated with a random oracle. We apply the above result (1), and get a linear lower bound for the sizes. (shrink)

Cet article analyse un rapport de l’Immigrants’ Protective League à Chicago (1931) qui porte sur le paiement des pensions alimentaires dans des familles séparées par la migration. Rédigé dans le cadre d’un projet de convention internationale sur l’assistance aux étrangers indigents, ce rapport présente les différentes tactiques utilisées par les travailleuses sociales de l’organisation pour réunir les familles afin d’éviter le recours aux tribunaux. L’analyse de la mise en récit des histoires de couples et de familles montre le processus de (...) légitimation du travail social international et met en évidence les pratiques des travailleuses sociales qui s’appuient sur les émotions pour rétablir un modèle social familial fragilisé par la migration. Le document permet aussi de retracer des projets et parcours migratoires qui font face à de nombreuses contraintes administratives et législatives. (shrink)

Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum algorithm is limited to the process of solving the problem. We extend it to the process of setting the problem. The number of the drawer with the ball becomes a unitary transformation of the random outcome of the (...) preparation measurement. This extended, time-symmetric, representation brings in relational quantum mechanics. It is with respect to Bob and any external observer and cannot be with respect to Alice. It would tell her the number of the drawer with the ball before she opens any drawer. To Alice, the projection of the quantum state due to the preparation measurement should be retarded at the end of her search; in the input state of the search, the drawer number is determined to Bob and undetermined to Alice. We show that, mathematically, one can ascribe any part of the selection of the random outcome of the preparation measurement to the final Alice’s measurement. Ascribing half of it explains the speedup of the present algorithm. This leaves the input state to Bob unaltered and projects that to Alice on a state of lower entropy where she knows half of the number of the drawer with the ball in advance. The quantum algorithm turns out to be a sum over histories in each of which Alice knows in advance that the ball is in a pair of drawers and locates it by opening one of the two. In the sample of quantum algorithms examined, the part of the random outcome of the initial measurement selected by the final measurement is one half or slightly above it. Conversely, given an oracle problem, the assumption it is one half always corresponds to an existing quantum algorithm and gives the order of magnitude of the number of oracle queries required by the optimal one. (shrink)

Summary The purpose of this study was to examine the effectiveness of contingent teacher praise, as specified by Canter's Assertive Discipline programme, on children's on?task behaviour. In Western Australian primary schools (and in an increasing number of British schools) Canter's programme is widely used. However, while there are many anecdotal reports of its effectiveness there is a relative absence of well controlled research studies reporting objective data. In the present study, three teachers from three separate primary schools and eight randomly (...) selected children from each of their classes were systematically observed. Continuous data collection indicated that following training in the appropriate use of praise, as specified by Canter, all three teachers successfully increased their rates of praising. Of the 24 children, all but one evidenced increases in levels of on?task behaviour. However, observations conducted during a follow?up phase revealed reductions in the use of praise by the teachers and in some levels of on?task behaviour. (shrink)

Palmer's principled distinction between first-person experience and scientific access is called into question. First, complete color transformations of experience and memory may be undetectable even from the first-person perspective. Second, transformations of (say) pain experiences seem to be intrinsically connected to certain effects, thus giving science access to these experiences, in principle. Evidence from pain research and emotional psychology indicates that further progress can be made.

I argue that Bohmian mechanics cannot reasonably be claimed to be a deterministic theory. If one assumes the “quantum equilibrium distribution” provided by the wave function of the universe, Bohmian mechanics requires an external random oracle in order to describe the algorithmic randomness properties of typical outcome sequences of long runs of repeated identical experiments. This oracle lies beyond the scope of Bohmian mechanics, including the impossibility of explaining the randomness property in question from “random” initial conditions. Thus (...) the advantages of Bohmian mechanics over other interpretations of quantum mechanics, if any, must lie at an ontological level, and in its potential to derive the quantum equilibrium distribution and hence the Born rule. (shrink)

The switch to online education that occurred during the Corona pandemic brought to the fore questions about the value and desirability of a fully online university. This article explores to what extent is a fully online university desirable from an educational perspective, whereby education is seen as a valuable experience taken in itself, regardless of its output. I start from the hypothesis that a fundamental dimension of study practices at the university is the experience of collective thinking triggered by specific (...) material and social arrangements. I proceed to describe material conditions for triggering thinking in terms of what I call mediatic displacement, which is a way of integrating media into educational practices that enables a fluctuating type of attention. The paper concludes by arguing that we need to develop new technologies for online education and train our attention deliberately for online environments by establishing new protocols for dealing with the digital scattering of attention. (shrink)

“Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin.”1 John von Neumann’s famous dictum points an accusing finger at all who set their ordered minds to engender disorder. Much as in times past thieves, pimps, and actors carried on their profession with an uneasy conscience, so in this day scientists who devise random number generators suffer pangs of guilt. George Marsaglia, perhaps the preeminent worker in the field, quips when he (...) asks his colleagues, “Who among us has not sinned?” Marsaglia’s work at the Supercomputer Computations Research Institute at Florida State University is well-known. Inasmuch as Marsaglia’s design and testing of random number generators depends on computation, and inasmuch as computation is fundamentally arithmetical, Marsaglia is by von Neumann’s own account a sinner. Working as he does on a supercomputer, Marsaglia is in fact a gross sinner. This he freely admits. Writing of the best random number generators he is aware of, Marsaglia states, “they are the result of arithmetic methods and those using them must, as all sinners must, face Redemption [sic] Day. But perhaps with better understanding we can postpone it.”. (shrink)

Michael Polanyi argues in Personal Knowledge (1958) that conceptual frameworks involved in major scientific controversies are separated by a `logical gap'. Such frameworks, according to Polanyi (1958: 151), are logically disconnected: their protagonists think differently, use different languages and occupy different worlds. Relinquishing one framework and adopting another, Polanyi's scientist undergoes a `conversion' to a new `faith'. Polanyi, in other words, presaged Kuhn and Feyerabend's concept of incommensurability. To what influences was Polanyi subject as he developed his concept of the (...) logical gap? The answer, as unfolded in this article, is twofold: Evans-Pritchard's Witchcraft, Oracles and Magic among the Azande and the Confessions of St Augustine. (shrink)

In the paper Randomizations of Scattered Sentences, Keisler showed that if Martin’s axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone. We show here that the answer is “yes”. It follows that the absolute Vaught conjecture holds if and only if every \-sentence with few separable randomizations has countably many countable models.

Vehicular ad hoc network is a multihop mobile wireless communication network that can realize many vehicle-related applications through multitop communication. In the open wireless communication environment, security and privacy protection are important contents of VANET research. The most basic method of VANET privacy protection is anonymous authentication. Even through, there are many existing schemes to provide anonymous authentication for VANETs. Many existing schemes suffer from high computational cost by using bilinear pairing operation or need the assistance of the trust authorities (...) during the authentication process or rely on an ideal tamper-proof device, which requires very strong security assumption. In this study, an anonymous authentication and key negotiation scheme by using private key and group key is proposed, which is based on pseudonym using the nonsingular elliptic curve. In this scheme, there is no third party trust center to participate in the authentication, there is no need to query the database, and there is no need of the local database to save the identity information of many vehicles, which reduce the storage space and the authentication time compared with other schemes. The proposed scheme only needs realistic TPDs. In the proposed scheme, TPDs do not need to preinstall the system key as many other schemes do; hence, the failure of a single TPD does not affect the security of the entire system. The security of the scheme is proved under the random oracle model. Compared with the related schemes using bilinear pairings, the computational cost and communication cost of the proposed scheme are reduced by 82% and 50%, respectively. (shrink)

Thomas Kuhn described the progress of science as comprising occasional paradigm shifts separated by interludes of ‘normal science’. The paradigm that has held sway since the inception of molecular biology is that genes (mainly) encode proteins. In parallel, theoreticians posited that mutation is random, inferred that most of the genome in complex organisms is non‐functional, and asserted that somatic information is not communicated to the germline. However, many anomalies appeared, particularly in plants and animals: the strange genetic phenomena of (...) paramutation and transvection; introns; repetitive sequences; a complex epigenome; lack of scaling of (protein‐coding) genes and increase in ‘noncoding’ sequences with developmental complexity; genetic loci termed ‘enhancers’ that control spatiotemporal gene expression patterns during development; and a plethora of ‘intergenic’, overlapping, antisense and intronic transcripts. These observations suggest that the original conception of genetic information was deficient and that most genes in complex organisms specify regulatory RNAs, some of which convey intergenerational information. Also see the video abstract here: https://youtu.be/qxeGwahBANw. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Plato on the Rhetoric of Philosophers and SophistsMichael SvobodaPlato on the Rhetoric of Philosophers and Sophists by Marina McCoy New York: Cambridge University Press, 2008. vii + 212 pp. $74.00, hardcover.With her new book, Marina McCoy, an assistant professor of philosophy at Boston College, succeeds in opening up new lines of inquiry into Plato’s formative engagement(s) with rhetoric: first, by involving other Platonic dialogues in the ongoing interrogations (...) of the Gorgias and Phaedrus and, second, by patiently considering the implications of the different accounts of sophists and philosophers that result. These new investigations are aided by the diverse disciplinary voices with which Marina McCoy herself converses—works by classicists, critics, philosophers, political theorists, and rhetoricians, works taken from a wide range of journals. In her interpretation of the Gorgias, for example, one encounters the names one would expect from a thorough and up-to-date review of these different literatures: Arieti, Dodds, Fussi, Gordon, McComiskey, Nightingale, Saxonhouse, and Yunis. Thus, Plato scholars from both rhetoric and philosophy will find much of interest in this book.McCoy provides a clear overview of her project in her introduction (1–22). In separate readings of the Apology, Protagoras, Gorgias, Republic, Sophist and Theaetetus, and Phaedrus, three interrelated claims are presented and developed: first, consistently distinguishing the philosopher from the sophist was a difficult challenge for Plato—and for the ancient Athenians; second, Plato’s conception of philosophy includes “important rhetorical dimensions,” and third, Plato ultimately differentiates the philosopher [End Page 191] from the sophist on the basis of character (3). To substantiate these claims, the dramatic and historical elements of Plato’s dialogues are interpreted in tandem with their explicit arguments. McCoy notes that the experience of reading the dialogues often reproduces the psychological tensions captured by them. In other words, Plato uses rhetorical techniques to cause his readers both to question philosophy and to engage in it as they do so (7). At the same time, McCoy recognizes that the terms of these discussions were hotly contested: “The Greek mindset at the time of Plato is one of passionate interest in the nature, power, and danger of logos : terms such as philosophia, rhetorike, sophist, and rhetor become part of the weaponry in the battle” (11). By attending to these elements in the seven dialogues examined in the following six chapters, McCoy seeks to show that philosophy is better defined as an interaction of souls than as a collection of analytical techniques, that the approach of Plato’s Socrates “relies more on phronesis and kairos than techne ” (15).These broad claims are immediately tested in the second chapter of the book, “Elements of Gorgianic Rhetoric and the Forensic Genre in Plato’s Apology ” (23–55). Here McCoy further develops two observations about the Apology. First, Socrates’ claims to the contrary, the Apology actually incorporates a number of elements common in forensic speeches at the time of his trial: a standard speech structure, arguments from probability ( eike ), and portrayal of character ( ethopoioa ) (26, 40). But perhaps more provocatively, second, in the Apology Plato seems to allude to Gorgias’ In Defense of Palamedes ; both speeches portray their speakers as public benefactors who cannot have committed the crimes of which they are accused but who nonetheless cannot defend themselves effectively under the conditions of their trial (32–39). When McCoy then calls our attention to the historical elements in the Apology —the life and death of Chaerophon, the role played in Athenian culture and politics by the oracle at Delphi, and the rules governing testimony—we must consider the possibility that Socrates may successfully be using rhetorical techniques, not to win his juror’s favor but to confuse and challenge them. Thrown off their moral balance, McCoy argues, his jurors might be led to question themselves. “Socrates’ risky choice to appeal to the oracle story forces each juror to make a choice: he must decide whether Socrates’ philosophical activity is a moral and even religious virtue” (51). In and through the Apology, Plato may be doing something very similar for his readers: “If Gorgias’ Encomium of Helen is a forensic piece disguised as [an] encomium, perhaps Plato’s Apology... (shrink)

The acceptance or rejection of classmates is one of the most widely recognized determinants of wellbeing in childhood. This study analyses psychosocial adjustment and sociometric status in primary education pupils, and possible differences by gender. A cross-sectional survey was undertaken in Huelva. The surveyed schools were selected using a stratified random sampling technique with both public and private elementary schools. Sample was composed of 247 4th grade students. Data revealed gender differences in psychosocial adjustment, particularly in terms of prosocial (...) behavior in girls and behavioral problems in boys. Popular and rejected statuses presented opposing adjustment profiles, particularly in hyperactive symptoms and behavioral problems. When the sample was separated by gender, the differences between the types of status in emotional symptomatology and prosocial behavior disappeared. In addition, the differences between statuses were greater in boys, and were defined mainly by hyperactivity, whilst for girls these differences were more apparent in behavioral problems. (shrink)

Babylonian Oracle Questions. By W. G. Lambert. Mesopotamian Civilizations, vol. 13. Winona Lake, Ind.: Eisenbrauns, 2007. Pp. xiv + 216, plates. $49.50.

In this paper we describe a propagation experiment to measure the one-way velocity of electromagnetic radiation. The experiment utilizes the rotation of the earth to interchange the positions of two rubidium vapor frequency standards over12 h, thereby canceling initial clock phase differences. It is demonstrated that although the drift characteristics of modern rubidium atomic clocks may be large for long-term absolute timing requirements, the short-term random fluctuations are small. It is found that over a24-h period, the long-term drift can (...) be accurately parameterized in retrospect and removed, thereby permitting the detection of temporal variations less than1 nsec in magnitude. With coherent summing techniques this value may be significantly reduced, and it becomes realistic to consider an experiment where the clocks are separated by distances of the order of several hundreds of meters in order to detect velocities of the order of that of the solar system with respect to the center of the galaxy(≈10 5 m sec −1 ), thus ensuring that the rotational motion of the earth has a negligible effect in altering the relative inertial characteristics of the reference frames of each clock. It is demonstrated that under such conditions the measurement of the one-way speed of propagation of electromagnetic radiation is not only meaningful, but can be simply implemented with commercially available instrumentation. (shrink)

Late last year the English Court of Appeal confirmed a lower court's ruling that doctors could impose an operation to separate recently born conjoined twins, overriding the refusal of consent of their parents. The doctors believed the operation would probably save one of the babies at the cost of killing the other, while not operating would highly probably be followed by the death of both twins within months of their birth. The parents, said to be devout Roman Catholics, believed that (...) it was absolutely wrong to kill one of their babies, even to save the life of the other.Undoubtedly many people, the writer included, would agree with the English courts that the “least worst” option was to separate the twins and save one at the cost of killing the other. But surely many fewer people would have imposed their own resolution of this acute moral dilemma upon parents who conscientiously chose the other limb of the dilemma, refusing to kill one baby even in order to save the other. Were the English judges right, then, to take away the parents' normal right and duty to make health care decisions on behalf of their children and instead impose their own answer to what they admitted to be a terrible dilemma? Describing the two alternatives in terms of choosing between the lesser of two evils on the one hand, and the obligation not to kill on the other, Lord Justice Ward declared, according to The Times law report,1 that: “Parents who were placed on the horns of such a terrible dilemma simply had to choose the lesser of their inevitable loss [sic]”. But that surely is to beg the moral question in favour of the judges' preferred answer to this moral dilemma. The fact is that there are—as …. (shrink)

You and I lead different lives. While we share a society and a world, our existence is separate from one another. You and I matter individually, by ourselves. My dissertation is about this simple thought. I argue that this simple insight, the separateness of persons, tells us something fundamental about morality. My dissertation seeks to answer how the separateness of persons matters. I develop a precise view of the demands of the separateness of persons. The separateness of persons imposes both (...) a requirement on the justification of first-order moral principles as well as a requirement on the content of first-order moral principles. In specifying these demands, I argue that respecting the separateness of persons requires taking into consideration each person’s point of view separately. This requires taking into account the moral relations in which individuals stand to one another. I make use of this relational understanding of the separateness of persons to advance various debates in moral and political philosophy. I argue for a framework to assess to which extent the veil of ignorance can be reconciled with the separateness of persons. I also argue for a new view on the ethics of risk which is a form of contractualism that discounts risks only by their objective risk. Furthermore, I argue for a new solution to the problem of aggregation that is skeptical of aggregation and can set plausible limits to aggregation. Lastly, I provide a new relational agent-based justification for deontological constraints. In addition to answering how the separateness of persons matters, I defend the separateness of persons against challenges. Most importantly, I argue that the importance of the separateness of persons is not undermined even if we believe that our personal identity, i.e. whether we persist as the same person, is unimportant. (shrink)