P-Selectivity, Immunity, and the Power of One Bit

We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is not EXP/1-immune. That is, we prove that some infinite P-selective set has no infinite EXP-time subset, but we also prove that every infinite P-selective set has some infinite subset in EXP/1. Informally put, the immunity of P-sel is so fragile that it is pierced by a single bit of information. The above claims follow from broader results that we obtain about the immunity of the P-selective sets. In particular, we prove that for every recursive function f, P-sel is DTIME(f)-immune. Yet we also prove that P-sel is not \Pi_2^p/1-immune

Relative Abundance, Seasonal Distribution and Taxonomy of Sphingidae of Northeast Arkansas

A total of 38 species of sphingids, with keys and descriptions, are reported from Northeast Arkansas. Graphs and tables are presented to show relative abundance and seasonal distribution. Drawings of genitalia, fore tibiae, and forewings, as well as photographs of species in the key are included

L. G. Selman to James Meredith (30 September 1962)

https://egrove.olemiss.edu/mercorr_anti/1209/thumbnail.jp

From one solution of a 3-satisfiability formula to a solution cluster: Frozen variables and entropy

A solution to a 3-satisfiability (3-SAT) formula can be expanded into a cluster, all other solutions of which are reachable from this one through a sequence of single-spin flips. Some variables in the solution cluster are frozen to the same spin values by one of two different mechanisms: frozen-core formation and long-range frustrations. While frozen cores are identified by a local whitening algorithm, long-range frustrations are very difficult to trace, and they make an entropic belief-propagation (BP) algorithm fail to converge. For BP to reach a fixed point the spin values of a tiny fraction of variables (chosen according to the whitening algorithm) are externally fixed during the iteration. From the calculated entropy values, we infer that, for a large random 3-SAT formula with constraint density close to the satisfiability threshold, the solutions obtained by the survey-propagation or the walksat algorithm belong neither to the most dominating clusters of the formula nor to the most abundant clusters. This work indicates that a single solution cluster of a random 3-SAT formula may have further community structures.Comment: 13 pages, 6 figures. Final version as published in PR

A double whammy for aging? Rapamycin extends lifespan and inhibits cancer in inbred female mice

Comment on: Anisimov VN, et al. Cell Cycle 2011; 10:4230-6

Nine New Species of \u3ci\u3eLacinipolia\u3c/i\u3e (Noctuidae) from Arizona, California and Vicinity

This article formalizes the taxonomic conclusions of the senior author’s 1975 successful doctorate dissertation. The nine new species defined in that 1975 dissertation are here formally described in compliance with the rules of the International Code of Zoological Nomenclature (ICZN). The authors have essentially abstracted the original 447 page dissertation and designated types. The new Lacinipolia species are: delongi, aileenae, triplehorni, bucketti, baueri, sharonae, martini, fordi, and franclemonti. The purpose of this paper is simply to make these names available to the scientific community and professional researchers by making them ICZN-compliant

Non-autoreducible Sets for NEXP

We investigate autoreducibility properties of complete sets for NEXP under different polynomial-time reductions. Specifically, we show that under some polynomial-time reductions there are complete sets for NEXP that are not autoreducible. We show that settling the question whether every complete set for NEXP under non-adaptative reduction is autoreducible under NOR-truth-table reduction either positively or negatively would lead to major results about the exponential time complexity classes

A second step toward the polynomial hierarchy

AbstractSome of the questions posed by Baker et al. [1] are here answered. The principal result is that there exists a recursive oracle for which the relativized polynomial hierarchy exists through the second level; that is, there is a recursive set B such that Σ2P,B ≠ Π2P,B. It follows that Σ2P,B ⊊ Σ3P,B