Designer Biology: The Ethics of Intensively Engineering Biological and Ecological Systems consists of thirteen chapters that address the ethical issues raised by technological intervention and design across a broad range of biological and ecological systems. Among the technologies addressed are geoengineering, human enhancement, sex selection, genetic modification, and synthetic biology.

All organisms possess mechanisms to repair double strand breaks (dsbs) generated in their DNA by damaging agents. Site‐specific dsbs are also introduced during V(D)J recombination. Four complementation groups of radiosensitive rodent mutants are defective in the repair of dsbs, and are unable to carry out V(D)J recombination effectively. The immune defect in Severe Combined Immunodeficient (scid) mice also results from an inability to undergo effective V(D)J recombination, and scid cell lines display a repair defect and belong to one of these (...) complementation groups. These findings indicate a mechanistic overlap between the processes of DNA repair and V(D)J recombination. Recently, two of the genes defined by these complementation groups have been identified and shown to encode components of DNA‐dependent protein kinase (DNA‐PK). We review here the three fields which have become linked by these findings, and discuss the involvement of DNA‐PK in dsb rejoining and in V(D)J recombination. (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)

Assume $\mathsf {ZF} + \mathsf {AD}$ and all sets of reals are Suslin. Let $\Gamma $ be a pointclass closed under $\wedge $, $\vee $, $\forall ^{\mathbb {R}}$, continuous substitution, and has the scale property. Let $\kappa = \delta (\Gamma )$ be the supremum of the length of prewellorderings on $\mathbb {R}$ which belong to $\Delta = \Gamma \cap \check \Gamma $. Let $\mathsf {club}$ denote the collection of club subsets of $\kappa $. Then the countable length everywhere club uniformization (...) holds for $\kappa $ : For every relation $R \subseteq {}^{<{\omega _1}}\kappa \times \mathsf {club}$ with the property that for all $\ell \in {}^{<{\omega _1}}\kappa $ and clubs $C \subseteq D \subseteq \kappa $, $R(\ell,D)$ implies $R(\ell,C)$, there is a uniformization function $\Lambda : \mathrm {dom}(R) \rightarrow \mathsf {club}$ with the property that for all $\ell \in \mathrm {dom}(R)$, $R(\ell,\Lambda (\ell ))$. In particular, under these assumptions, for all $n \in \omega $, $\boldsymbol {\delta }^1_{2n + 1}$ satisfies the countable length everywhere club uniformization. (shrink)

Assume [Formula: see text]. If [Formula: see text] is an ordinal and X is a set of ordinals, then [Formula: see text] is the collection of order-preserving functions [Formula: see text] which have uniform cofinality [Formula: see text] and discontinuous everywhere. The weak partition properties on [Formula: see text] and [Formula: see text] yield partition measures on [Formula: see text] when [Formula: see text] and [Formula: see text] when [Formula: see text]. The following almost everywhere continuity properties for functions on (...) partition spaces with respect to these partition measures will be shown. For every [Formula: see text] and function [Formula: see text], there is a club [Formula: see text] and a [Formula: see text] so that for all [Formula: see text], if [Formula: see text] and [Formula: see text], then [Formula: see text]. For every [Formula: see text] and function [Formula: see text], there is an [Formula: see text]-club [Formula: see text] and a [Formula: see text] so that for all [Formula: see text], if [Formula: see text] and [Formula: see text], then [Formula: see text]. The previous two continuity results will be used to distinguish the cardinalities of some important subsets of [Formula: see text]. [Formula: see text]. [Formula: see text]. [Formula: see text]. It will also be shown that [Formula: see text] has the Jónsson property: For every [Formula: see text], there is an [Formula: see text] with [Formula: see text] so that [Formula: see text]. (shrink)

Schmidt’s game and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the players make moves from a complete separable metric space. The determinacy of these games trivially follows from the axiom of determinacy for real games, $\mathsf {AD}_{\mathbb R}$, which is a much stronger axiom than that asserting all integer games are determined, $\mathsf {AD}$. One of (...) our main results is a general theorem which under the hypothesis $\mathsf {AD}$ implies the determinacy of intersection games which have a property allowing strategies to be simplified. In particular, we show that Schmidt’s $(\alpha,\beta,\rho )$ game on $\mathbb R$ is determined from $\mathsf {AD}$ alone, but on $\mathbb R^n$ for $n \geq 3$ we show that $\mathsf {AD}$ does not imply the determinacy of this game. We then give an application of simple strategies and prove that the winning player in Schmidt’s $(\alpha, \beta, \rho )$ game on $\mathbb {R}$ has a winning positional strategy, without appealing to the axiom of choice. We also prove several other results specifically related to the determinacy of Schmidt’s game. These results highlight the obstacles in obtaining the determinacy of Schmidt’s game from $\mathsf {AD}$. (shrink)

We introduce the notion of -determinacy for Γ a pointclass and E an equivalence relation on a Polish space X. A case of particular interest is the case when E = EG is the shift-action o...

Studies of implicit learning have shown that individuals exposed to a rule-governed environment often learn to exploit 'rules' which describe the structural relationship between environmental events. While some authors have interpreted such demonstrations as evidence for functionally separate implicit learning systems, others have argued that the observed changes in performance result from explicit knowledge which has been inadequately assessed. In this paper we illustrate this issue by considering one commonly used implicit learning task, the Serial reaction time task, and outline (...) what we see as an important problem associated with each of the commonly used methods used to assess explicit knowledge. This is that each measure requires a form of response which is dependent on the subjects having some knowledge of the serial-order of the sequence. We argue that such methods, or more specifically their analyses, seriously underestimate other sources of knowledge, which may be available to subjects during their performance of the SRT task. In support of this argument we demonstrate that subjects' serial-order knowledge can, in principle, be independent of subjects' knowledge of the statistical structure of the sequence, and we propose an alternative method for analysing performance on the Generate task which avoids this problem. (shrink)

Evidence from optic ataxic patients with bilateral lesions to the superior parietal lobes does not support the view that there are separate planning and control mechanisms located in the IPL and SPL respectively. The aberrant reaches of patients with bilateral SPL damage towards extrafoveal targets seem to suggest a deficit in the selection of appropriate motor programmes rather than a deficit restricted to on-line control.