We will show that there is a strong form of emergence in cell biology. Beginning with C.D. Broad's classic discussion of emergence, we distinguish two conditions sufficient for emergence. Emergence in biology must be compatible with the thought that all explanations of systemic properties are mechanistic explanations and with their sufficiency. Explanations of systemic properties are always in terms of the properties of the parts within the system. Nonetheless, systemic properties can still be emergent. If the properties of the components (...) within the system cannot be predicted, even in principle, from the behavior of the system's parts within simpler wholes then there also will be systemic properties which cannot be predicted, even in principle, on basis of the behavior of these parts. We show in an explicit case study drawn from molecular cell physiology that biochemical networks display this kind of emergence, even though they deploy only mechanistic explanations. This illustrates emergence and its place in nature. (shrink)

Galileo’s Sunspot Letters, published in 1613, underwent extensive censorship before publication. It seems likely that the Roman Inquisition had charge of the pre-publication review of Galileo’s work, rather than the usual organ, the Master of the Sacred Palace. A study of that process demonstrates that the issue to which the censors objected was Galileo’s use of the bible, not his allegiance to Copernicus. In the course of the first phase of Galileo’s trial, orchestrated by one of the most powerful Cardinal (...) Inquisitors, two propositions allegedly drawn from the book were judged either “formally heretical” or “at least erroneous in the faith.” These judgments might have come not from the published book but from the Inquisition’s censorship of its drafts. They supported Galileo’s silencing in 1616.Keywords: Galileo; Sunspot Letters; Roman Inquisition; Bible; Censorship; Heliocentrism. (shrink)

According to the Rome newspaper La Repubblica, 2009 was “a year for Galileo and all the stars.” The headline referred to the UN’s declaration, at Italian urging, of an international year of astronomy celebrating Galileo’s first use of the telescope. The Italians marked the event in epic fashion, including a mega-conference in Florence and many smaller affairs. What they did not do was produce a new biography. That was left to an Englishman, David Wootton, and an American, John Heilbron.Heilbron’s Galileo (...) is a Florentine humanist, master rhetorician, fond of metaphor and analogy in place of causal analysis. Casting Galileo as a humanist is not new: that was Giorgio de Santillana’s view 50 years ago. Nor is bringing out Galileo’s passion for Orlando Furioso, except that Heilbron pulls serious implications out of it, especially Galileo’s inventiveness and strong preference for verisimilitude which led him to rely on rhetoric rather than geometry. Galileo’s specific liking for Ariosto is p .. (shrink)

In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ‮א‬₀-categorical saturated structure with a unique computable isomorphism type? Our answer is affirmative and uses a construction based on Kolmogorov complexity. With a variation of this construction, we also provide an example of an ‮א‬₁-categorical but not ‮א‬₀-categorical saturated $\Sigma _{1}^{0}$ -structure with a unique computable isomorphism type. In addition, using the construction we give an example of an ‮א‬₁-categorical but (...) not ‮א‬₁-categorical theory whose only non-computable model is the prime one. (shrink)

Rice's Theorem says that every nontrivia semantic property of programs is undecidable. In this spirit we show the following: Every nontrivia absolute counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice's Theorem.

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x), f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determine exactly how hard it is to enumerate the Kolmogorov function, which (...) assigns to each string x its Kolmogorov complexity: • For every underlying universal machine U, there is a constant a such that C is k(n)-enumerable only if k(n) ≥ n/a for almost all n. • For any given constant k, the Kolmogorov function is k-enumerable relative to an oracle A if and only if A is at least as hard as the halting problem. • There exists an r.e., Turing-incomplete set A such for every non-decreasing and unbounded recursive function k, the Kolmogorov function is k(n)-enumerable relative to A. The last result is obtained by using a relativizable construction for a nonrecursive set A relative to which the prefix-free Kolmogorov complexity differs only by a constant from the unrelativized prefix-free Kolmogorov complexity. Although every 2-enumerator for C is Turing hard for K, we show that reductions must depend on the specific choice of the 2-enumerator and there is no bound on the quantity of their queries. We show our negative results even for strong 2-enumerators as an oracle where the querying machine for any x gets directly an explicit list of all hypotheses of the enumerator for this input. The limitations are very general and we show them for any recursively bounded function g: • For every Turing reduction M and every non-recursive set B, there is a strong 2-enumerator f for g such that M does not Turing reduce B to f. • For every non-recursive set B, there is a strong 2-enumerator f for g such that B is not wtt-reducible to f. Furthermore, we deal with the resource-bounded case and give characterizations for the class ${\rm S}_{2}^{{\rm P}}$ introduced by Canetti and independently Russell and Sundaram and the classes PSPACE, EXP. • ${\rm S}_{2}^{{\rm P}}$ is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time tt-reduction which reduces A to every strong 2-enumerator for g. • PSPACE is the class of all sets A for which there is a polynomially bounded function g such that there is a polynomial time Turing reduction which reduces A to every strong 2-enumerator for g. Interestingly, g can be taken to be the Kolmogorov function for the conditional space bounded Kolmogorov complexity. • EXP is the class of all sets A for which there is a polynomially bounded function g and a machine M which witnesses A ∈ PSPACEf for all strong 2-enumerators f for g. Finally, we show that any strong O(log n)-enumerator for the conditional space bounded Kolmogorov function must be PSPACE-hard if P = NP. (shrink)

My aim in this article is to explore ways in which American thought influenced and transformed European understandings of nature. The framework of such an attempt is a transatlantic history of ideas. I focus on two examples, in which I turn to texts by Friedrich Nietzsche and Rudolf Otto. My argument consists of four parts.From as early as the end of the nineteenth century, Nietzsche has been read as a critic of naturalism and his philosophy of art as a defense (...) of radical subjectivity.1 While the diagnosis of a philosophy of radical subjectivity is appropriate, the purported opposition to naturalism is a fallacy. Because Nietzsche only expresses himself in aphoristic or essayistic forms, however, it is not an easy .. (shrink)

A number of distinct definitions ofsustainable agriculture have been proposed. In this paper we criticize two such definitions, primarily for conflating sustainability with other objectives such as economic viability and ecological integrity. Finally, we propose and defend a definition which avoids our objections to the other definitions.

We study reals with infinitely many incompressible prefixes. Call $A \in 2^{\omega}$ Kolmogorot random if $(\exists^{\infty}n) C(A \upharpoonright n) \textgreater n - \mathcal{O}(1)$ , where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by $Martin-L\ddot{0}f$ , Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random. Together with the converse-proved by Nies. Stephan and Terwijn [11]-this provides a natural characterization of 2-randomness in terms of plain complexity. We finish with a related characterization of (...) 2-randomness. (shrink)

Emotion-cognition interactions are critical in goal-directed behavior and may be disrupted in psychopathology. Growing evidence also suggests that emotion-cognition interactions are modulated by genetic variation, including genetic variation in the serotonin system. The goal of the current study was to examine the impact of threat-related distracters and serotonin transporter promoter polymorphism (5-HTTLPR/rs25531) on cognitive task performance in healthy females. Using a novel threat-distracter version of the Multiple-Source Interference Task specifically designed to probe emotion-cognition interactions, we demonstrate a robust and temporally (...) dynamic modulation of cognitive interference effects by threat-related distracters relative to other distracter types and relative to no-distracter condition. We further show that threat-related distracters have dissociable and opposite effects on cognitive task performance in easy and difficult task conditions, operationalized as the level of response interference that has to be surmounted to produce a correct response. Finally, we present evidence that the 5-HTTLPR/rs25531 genotype in females modulates susceptibility to cognitive interference in a global fashion, across all distracter conditions and irrespective of the emotional salience of distracters, rather than specifically in the presence of threat-related distracters. Taken together, these results add to our understanding of the processes through which threat-related distracters affect cognitive processing, and may have implications for our understanding of disorders in which threat signals may have a particularly detrimental effect on cognition, including depression and anxiety disorders. (shrink)

This paper examines the theoretical background and actual behavior in a gaming tournament with endogenous timing where a person has more incentive, structure, and time to form a strategy. The baseline treatment suggests that subgame perfection is a reasonable predictor of behavior â- subjects made 170 of 208 theoretically predicted choices of best actions, with the majority of mistakes made in timing choices by the players who did not survive the cut to the second round. Four sensitivity treatments established that (...) the design feature that lead to more predictable behavior was time to think â- 745 of 960 correctly predicted decisions with more time versus 595 of 960 with less time. A random effects Probit model suggests that the key design feature that closed the gap between predicted and observed behavior was not necessarily the non-linear payoffs created by the tournament design, but rather that the key was providing people with more time to think about their strategy. (shrink)

In this paper I examine an argument that has been made by Patrick Grim for the claim that de se knowledge is incompatible with the existence of an omniscient being. I claim that the success of the argument depends upon whether it is possible for someone else to know what I know in knowing (F), where (F) is a claim involving de se knowledge. I discuss one reply to this argument, proposed by Edward Wierenga, that appeals to first-person propositions and (...) argue that this response is unsuccessful. I then consider David Lewis’s theory of de se attitudes involving the self-ascription of properties. I claim that, according to this theory, there are two senses in which someone else can know what I know in knowing (F). I then argue that the second sense allows for the compatibility of de se knowledge with the existence of an omniscient being. (shrink)

To date the problem of finding a general characterization of injective enumerability of recursively enumerable (r.e) classes of r.e. sets has proved intractable. This paper investigates the problem for r.e. classes of cofinite sets. We state a suitable criterion for r.e. classesC such that there is a boundn∈ω with |ω-A|≤n for allA∈C. On the other hand an example is constructed which shows that Lachlan's condition (F) does not imply injective enumerability for r.e. classes of cofinite sets. We also look at (...) a certain embeddability property and show that it is equivalent with injective enumerability for certain classes of cofinite sets. At the end we present a reformulation of property (F). (shrink)