Relativized obliviousness

Relativized obliviousness is introduced to capture the intuitive idea, that some problems allow fastest computations which are more oblivious than do other problems, without any of such computations being oblivious in the standard sense. It is shown that each increase in the obliviousness of an algorithm (in several different well-defined meanings), for the solution of some problems, may necessarily require an increase in computation time from T(n) steps to T(n) log T(n) steps. There is, however, no problem for which a total oblivious algorithm requires more than order T(n) log T(n) steps, if the best algorithm for it runs in T(n) steps. We use on-line Turing machines as model of computation

Query Order and the Polynomial Hierarchy

Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for the first time, query order as it applies to the levels of the polynomial hierarchy. We prove that the levels of the polynomial hierarchy are order-oblivious. Yet, we also show that these ordered query classes form new levels in the polynomial hierarchy unless the polynomial hierarchy collapses. We prove that all leaf language classes - and thus essentially all standard complexity classes - inherit all order-obliviousness results that hold for P.Comment: 14 page

Intoxication, Recklessness, and Negligence

According to what is here called the “Intoxication Recklessness Principle,” a defendant who, thanks to voluntary intoxication, is unaware of a condition of which a reasonable person would have been aware is to be treated as though he were reckless with respect to that condition, rather than negligent. And, according to what is here called the “Intoxication Negligence Principle,” a defendant who is unaware of a condition thanks to voluntary intoxication is to be compared to a sober reasonable person when we ask whether his obliviousness was reasonable. When applied in tandem, as these principles often are, a defendant whose mental state is not criminal at all, considered independently of the recent history of intoxication that gave rise to it, will be treated as though he were reckless. Through a proposed model that illuminates the nature of both recklessness and negligence, this paper identifies a set of conditions under which it is justified to employ the Intoxication Recklessness Principle, even in conjunction with the Intoxication Negligence Principle. When the relevant conditions are met, the voluntarily intoxicated negligent defendant is in a mental state that is just as bad as many reckless defendants. This paper, then, defends the law’s current use of the Intoxication Recklessness Principle, but with qualifications, for in identifying the conditions in which the principle is justifiably employed; conditions are also identified in which it is not

Against Minimalist Responses to Moral Debunking Arguments

Moral debunking arguments are meant to show that, by realist lights, moral beliefs are not explained by moral facts, which in turn is meant to show that they lack some significant counterfactual connection to the moral facts (e.g., safety, sensitivity, reliability). The dominant, “minimalist” response to the arguments—sometimes defended under the heading of “third-factors” or “pre-established harmonies”—involves affirming that moral beliefs enjoy the relevant counterfactual connection while granting that these beliefs are not explained by the moral facts. We show that the minimalist gambit rests on a controversial thesis about epistemic priority: that explanatory concessions derive their epistemic import from what they reveal about counterfactual connections. We then challenge this epistemic priority thesis, which undermines the minimalist response to debunking arguments (in ethics and elsewhere)

On the Structure of Learnability Beyond P/Poly

Motivated by the goal of showing stronger structural results about the complexity of learning, we study the learnability of strong concept classes beyond P/poly, such as PSPACE/poly and EXP/poly. We show the following: 1) (Unconditional Lower Bounds for Learning) Building on [Adam R. Klivans et al., 2013], we prove unconditionally that BPE/poly cannot be weakly learned in polynomial time over the uniform distribution, even with membership and equivalence queries. 2) (Robustness of Learning) For the concept classes EXP/poly and PSPACE/poly, we show unconditionally that worst-case and average-case learning are equivalent, that PAC-learnability and learnability over the uniform distribution are equivalent, and that membership queries do not help in either case. 3) (Reducing Succinct Search to Decision for Learning) For the decision problems R_{Kt} and R_{KS} capturing the complexity of learning EXP/poly and PSPACE/poly respectively, we show a succinct search to decision reduction: for each of these problems, the problem is in BPP iff there is a probabilistic polynomial-time algorithm computing circuits encoding proofs for positive instances of the problem. This is shown via a more general result giving succinct search to decision results for PSPACE, EXP and NEXP, which might be of independent interest. 4) (Implausibility of Oblivious Strongly Black-Box Reductions showing NP-hardness of learning NP/poly) We define a natural notion of hardness of learning with respect to oblivious strongly black-box reductions. We show that learning PSPACE/poly is PSPACE-hard with respect to oblivious strongly black-box reductions. On the other hand, if learning NP/poly is NP-hard with respect to oblivious strongly black-box reductions, the Polynomial Hierarchy collapses

Ironic Faith in Monty Python’s Life of Brian

Monty Python’s Life of Brian tells the story of Brian, a contemporary of Jesus whose life becomes chaotic when he is mistaken for a messiah. Standard comedic devices are used to mock and ridicule those who use their authority or office to claim that they are more than human. In this case, laughter humbles those individuals and brings them back to the human community. Second, an ironic faith perspective allows the Pythons to assert that it is up to each individual to define the meaning of his/her own life. While some interpretations of ironic faith suggest the possibility of an ethical response to the perception of the gap between what is and what ought to be, the vision of the absurd in Life of Brian is focused more on the individual than on the community. The end result of an ironic faith is not a call to change the world but inclusion in a community of people who share the same ironic vision

Watching “Insidious” – On the Social Construction of Fear

As mass media are an integral part of our everyday lives, their role in constituting emotions and feeling rules receives heightened attention. However, content analyses and psychoanalytical/reaction analyses focus on a film-viewer-relation that does not consider the group character of media consumption. This article deals with the question of how fear is socially constructed and interactively negotiated by taking an ethnomethodological look at videos that teenagers have taken of themselves while watching the horror movie Insidious. It puts forward two inter-related forms of ambiguity: the ambiguity of what emotions are appropriate, that is, the ways in which feeling rules are treated as topics and as features of the viewing settings, and, secondly, the ambiguity of belonging that concerns the question of how several viewers can draw themselves out of a terrifying situation while simultaneously ensuring that the group is held together. Fear is regarded as a separating emotion insofar as actors withdraw, actively locate their bodies as barriers against the movie’s sensual impressions and thus simultaneously constrain interaction by blocking central channels of communication. Special attention is given to the ways in which this affects interaction. The article contributes to the understanding of visual spectatorship and the undertaking of bringing affect into media studies by bringing together audience research and emotion sociology

Easiness Amplification and Uniform Circuit Lower Bounds

We present new consequences of the assumption that time-bounded algorithms can be "compressed" with non-uniform circuits. Our main contribution is an "easiness amplification" lemma for circuits. One instantiation of the lemma says: if n^{1+e}-time, tilde{O}(n)-space computations have n^{1+o(1)} size (non-uniform) circuits for some e > 0, then every problem solvable in polynomial time and tilde{O}(n) space has n^{1+o(1)} size (non-uniform) circuits as well. This amplification has several consequences: * An easy problem without small LOGSPACE-uniform circuits. For all e > 0, we give a natural decision problem, General Circuit n^e-Composition, that is solvable in about n^{1+e} time, but we prove that polynomial-time and logarithmic-space preprocessing cannot produce n^{1+o(1)}-size circuits for the problem. This shows that there are problems solvable in n^{1+e} time which are not in LOGSPACE-uniform n^{1+o(1)} size, the first result of its kind. We show that our lower bound is non-relativizing, by exhibiting an oracle relative to which the result is false. * Problems without low-depth LOGSPACE-uniform circuits. For all e > 0, 1 < d < 2, and e < d we give another natural circuit composition problem computable in tilde{O}(n^{1+e}) time, or in O((log n)^d) space (though not necessarily simultaneously) that we prove does not have SPACE[(log n)^e]-uniform circuits of tilde{O}(n) size and O((log n)^e) depth. We also show SAT does not have circuits of tilde{O}(n) size and log^{2-o(1)}(n) depth that can be constructed in log^{2-o(1)}(n) space. * A strong circuit complexity amplification. For every e > 0, we give a natural circuit composition problem and show that if it has tilde{O}(n)-size circuits (uniform or not), then every problem solvable in 2^{O(n)} time and 2^{O(sqrt{n log n})} space (simultaneously) has 2^{O(sqrt{n log n})}-size circuits (uniform or not). We also show the same consequence holds assuming SAT has tilde{O}(n)-size circuits. As a corollary, if n^{1.1} time computations (or O(n) nondeterministic time computations) have tilde{O}(n)-size circuits, then all problems in exponential time and subexponential space (such as quantified Boolean formulas) have significantly subexponential-size circuits. This is a new connection between the relative circuit complexities of easy and hard problems

Relative clauses and conjunctive adjuncts in Syrian University student writing in English

Initial investigations into English essays written by Syrian university students triangulated Syrian and British teachers’ evaluations of the essays and the lexico-grammatical features they identified as affecting the overall quality of writing, with text analyses of the sources, types and frequency of all grammatical errors. Following this, and a review of relevant literature, the thesis presents an in-depth study of relative clauses and conjunctive adjuncts as under-researched features in Arabic speaking university student writing that can enrich their writing syntactically and semantically. The relative clause (RC) analysis shows that the 'full' form RC occurred much more frequently than the 'reduced' form, and that confusion between these two forms was a prominent source of student error. 'Pronoun retention' errors indicating L1 interference were among the most frequent RC errors – as most studies of RC use by Arab learners find. Moreover, RC constructions with 'head noun' (or antecedent) in the non-subject position and 'gap' (or relativized NP/sentence) in the subject position were dominant, while other, and more complex, construction types were much less common. This supports the AHH and PDH hypotheses on the frequency/difficulty hierarchy of RC types. Conjunctive adjunct analysis reveals that 'additive' conjunctive adjuncts were more frequent, followed by 'causals'. Despite its informality, the resultive conjunctive adjunct 'so' was used most repeatedly, followed by 'also', 'but', and 'and'. Causal conjunctive adjuncts were most frequently misused, though in general conjunctive adjunct misuse is not a major weakness. Contrastive analysis between the L2 (Syrian) and an equivalent L1 (British) corpus of literature essays revealed no significant difference between the total frequencies of RCs, 'full' RCs and 'non-subject-subject' RCs. In contrast, the total frequencies of conjunctive adjuncts in the two corpora were significantly different, with the L2 corpus containing almost twice as many conjunctive adjuncts as the L1 corpus, particularly causals and additives, this latter category being most frequent in both corpora. The British students' employment of relative clause types and conjunctive expressions was generally more diverse than that of the Syrian students. Pedagogical implications conclude this thesis