An illustrated exploration of fandom that combines academic essays with artist pages and experimental texts. Fandom as Methodology examines fandom as a set of practices for approaching and writing about art. The collection includes experimental texts, autobiography, fiction, and new academic perspectives on fandom in and as art. Key to the idea of “fandom as methodology” is a focus on the potential for fandom in art to create oppositional spaces, communities, and practices, particularly from queer perspectives, but also through transnational, (...) feminist and artist-of-color fandoms. The book provides a range of examples of artists and writers working in this vein, as well as academic essays that explore the ways in which fandom can be theorized as a methodology for art practice and art history. Fandom as Methodology proposes that many artists and art writers already draw on affective strategies found in fandom. With the current focus in many areas of art history, art writing, and performance studies around affective engagement with artworks and imaginative potentials, fandom is a key methodology that has yet to be explored. Interwoven into the academic essays are lavishly designed artist pages in which artists offer an introduction to their use of fandom as methodology. Contributors Taylor J. Acosta, Catherine Grant, Dominic Johnson, Kate Random Love, Maud Lavin, Owen G. Parry, Alice Butler, SooJin Lee, Jenny Lin, Judy Batalion, Ika Willis. Artists featured in the artist pages Jeremy Deller, Ego Ahaiwe Sowinski, Anna Bunting-Branch, Maria Fusco, Cathy Lomax, Kamau Amu Patton, Holly Pester, Dawn Mellor, Michelle Williams Gamaker, The Women of Colour Index Reading Group, Liv Wynter, Zhiyuan Yang. (shrink)

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give (...) a meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅. We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C ≥ |x|-c. The ‘only if' direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity. Next we (...) prove some results on lowness. Among other things, we characterize the 2-random sets as those 1-random sets that are low for Chaitin's Ω. Also, 2-random sets form minimal pairs with 2-generic sets. The r.e. low for Ω sets coincide with the r.e. K-trivial ones. Finally we show that the notions of Martin-Löf randomness, recursive randomness, and Schnorr randomness can be separated in every high degree while the same notions coincide in every non-high degree. We make some remarks about hyperimmune-free and PA-complete degrees. (shrink)

We develop and knit together several theodicies in order to find a more complete picture of why certain forms of animal suffering might be permitted by a perfect being. We focus on an especially potent form of the problem of evil, which arises from considering why a perfectly good, wise, and powerful God might use evolutionary mechanisms that predictably result in so much animal suffering and loss of life. There are many existing theodicies on the market, and although they offer (...) helpful resources, we combine and further develop several proposals to produce a composite theodicy that avoids certain shortcomings of the individual theodicies. An important element of our project is locating a role for randomness in cosmic and biological evolution. In particular, we show how randomness might enhance or enable certain goods, including everlasting goods, at the risk of temporary evils. (shrink)

A set $B\subseteq\mathbb{N}$ is called low for Martin-Löf random if every Martin-Löf random set is also Martin-Löf random relative to B . We show that a $\Delta^0_2$ set B is low for Martin-Löf random if and only if the class of oracles which compress less efficiently than B , namely, the class $\mathcal{C}^B=\{A\ |\ \forall n\ K^B(n)\leq^+ K^A(n)\}$ is countable (where K denotes the prefix-free complexity and $\leq^+$ denotes inequality modulo a constant. It follows that $\Delta^0_2$ (...) is the largest arithmetical class with this property and if $\mathcal{C}^B$ is uncountable, it contains a perfect $\Pi^0_1$ set of reals. The proof introduces a new method for constructing nontrivial reals below a $\Delta^0_2$ set which is not low for Martin-Löf random. (shrink)

This research note challenges the idea that Random Somatic Mutations are entirely random, highlighting their non-equiprobable nature and their influence on evolution, involution, or indeterminacy. It recalls the Neutrosophic Theory of Evolution, extending Darwin’s theory, and emphasizes the importance of distinguishing between different senses of ‘random mutation’ in evolutionary theory.

We consider two ways one might use algorithmic randomness to characterize a probabilistic law. The first is a generative chance* law. Such laws involve a nonstandard notion of chance. The second is a probabilistic* constraining law. Such laws impose relative frequency and randomness constraints that every physically possible world must satisfy. While each notion has virtues, we argue that the latter has advantages over the former. It supports a unified governing account of non-Humean laws and provides independently motivated solutions to (...) issues in the Humean best-system account. On both notions, we have a much tighter connection between probabilistic laws and their corresponding sets of possible worlds. Certain histories permitted by traditional probabilistic laws are ruled out as physically impossible. As a result, such laws avoid one variety of empirical underdetermination, but the approach reveals other varieties of underdetermination that are typically overlooked. (shrink)

The Element reconstructs, analyses and compares different derivational routes to a grounding of the Arrow of Time in entropy. It also evaluates the link between entropy and visible disorder, and the related claim of an alignment of the Arrow of Time with a development from order to visible disorder. The Element identifies three different entropy-groundings for the Arrow of Time: (i) the Empirical Arrow of Time, (ii) the Universal Statistical Arrow of Time, and (iii) the Local Statistical Arrow of Time. (...) The Element will also demonstrate that it is unlikely that high entropy states will always coincide with visible disorder. Therefore, it will dispute that there is a strong link between the Arrow of Time and visible disorder. (shrink)

The latter half of the twentieth century has been marked by debates in evolutionary biology over the relative significance of natural selection and random drift: the so-called “neutralist/selectionist” debates. Yet John Beatty has argued that it is difficult, if not impossible, to distinguish the concept of random drift from the concept of natural selection, a claim that has been accepted by many philosophers of biology. If this claim is correct, then the neutralist/selectionist debates seem at best futile, and (...) at worst, meaningless. I reexamine the issues that Beatty raises, and argue that random drift and natural selection, conceived as processes, can be distinguished from one another. (shrink)

Are there any truly ontologically random events? This paper argues that randomness is an unavoidably epistemic concept and therefore ascription of ontological randomness to any particular event or series of events can never be justified.

In this paper, we examine the pioneering research on electronic noise—the current fluctuations in electronic circuit devices due to their intrinsic physical characteristics rather than their defects—in Germany and the U.S. during the 1910s–1920s. Such research was not just another demonstration of the general randomness of the physical world Einstein’s work on Brownian motion had revealed. In contrast, we stress the importance of a particular engineering context to electronic noise studies: the motivation to design and improve high-gain thermionic-tube amplifiers for (...) radio and wired communications. Engineering scientists’ endeavors to understand electronic noise started in 1918, when Walter Schottky at Siemens formulated a theory of “shot noise,” current fluctuations owing to the random emissions of discrete electrons in a tube. Schottky’s theory was revised and experimentally tested at Siemens, General Electric, and AT&T during the 1920s, leading to the discoveries of several other types of noise and an increasing interest in the thermal fluctuations in electronic circuits. In 1925–1928, J.B. Johnson and Harry Nyquist at Bell Labs developed a theory of thermal noise for any electrical resistor at a non-zero temperature. Although these studies were initiated to chart the fundamental performance limit of electronic technology, they ended up assisting the empirical determination of individual electronic components’ characteristics. (shrink)

A semimeasure is a generalization of a probability measure obtained by relaxing the additivity requirement to superadditivity. We introduce and study several randomness notions for left-c.e. semimeasures, a natural class of effectively approximable semimeasures induced by Turing functionals. Among the randomness notions we consider, the generalization of weak 2-randomness to left-c.e. semimeasures is the most compelling, as it best reflects Martin-Löf randomness with respect to a computable measure. Additionally, we analyze a question of Shen, a positive answer to which would (...) also have yielded a reasonable randomness notion for left-c.e. semimeasures. Unfortunately, though, we find a negative answer, except for some special cases. (shrink)

We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ. In other words. B is at least as good as A for this purpose. We study the structure of the LR degrees globally and locally (i.e., restricted to the computably enumberable degrees) and their relationship with the Turing degrees. Among other results we show that whenever α in not GL₂ the LR (...) degree of α bounds $2^{\aleph _{0}}$ degrees (so that, in particular, there exist LR degrees with uncountably many predecessors) and we give sample results which demonstrate how various techniques from the theory of the c.e. degrees can be used to prove results about the c.e. LR degrees. (shrink)

The concept of randomness has been unjustly neglected in recent philosophical literature, and when philosophers have thought about it, they have usually acquiesced in views about the concept that are fundamentally flawed. After indicating the ways in which these accounts are flawed, I propose that randomness is to be understood as a special case of the epistemic concept of the unpredictability of a process. This proposal arguably captures the intuitive desiderata for the concept of randomness; at least it should suggest (...) that the commonly accepted accounts cannot be the whole story and more philosophical attention needs to be paid. 1. Randomness in science1.1Random systems1.2Random behaviour1.3Random sampling1.4Caprice, arbitrariness and noise2. Concepts of randomness2.1Von Mises/church/martin-löf randomness2.2KCS-randomness3. Randomness is unpredictability: preliminaries3.1Process and product randomness3.2Randomness is indeterminism?4. Predictability4.1Epistemic constraints on prediction4.2Computational constraints on prediction4.3Pragmatic constraints on prediction4.4Prediction defined5. Unpredictability6. Randomness is unpredictability6.1Clarification of the definition of randomness6.2Randomness and probability6.3Subjectivity and context sensitivity of randomness7. Evaluating the analysis[R]andomness … is going to be a concept which is relative to our body of knowledge, which will somehow reflect what we know and what we don't know. Henry E. Kyburg, Jr ([1974], p. 217)Phenomena that we cannot predict must be judged random. Patrick Suppes ([1984], p. 32). (shrink)

In 1947 Donald Cary Williams claimed in The Ground of Induction to have solved the Humean problem of induction, by means of an adaptation of reasoning first advanced by Bernoulli in 1713. Later on David Stove defended and improved upon Williams’ argument in The Rational- ity of Induction (1986). We call this proposed solution of induction the ‘Williams-Stove sampling thesis’. There has been no lack of objections raised to the sampling thesis, and it has not been widely accepted. In our (...) opinion, though, none of these objections has the slightest force, and, moreover, the sampling thesis is undoubtedly true. What we will argue in this paper is that one particular objection that has been raised on numerous occasions is misguided. This concerns the randomness of the sample on which the inductive extrapolation is based. (shrink)

A number of formal models, including a highly influential model from Hong and Page, purport to show that functionally diverse groups often beat groups of individually high-performing agents in solving problems. Thompson argues that in Hong and Page’s model, that the diverse groups are created by a random process explains their success, not the diversity. Here, I defend the diversity interpretation of the Hong and Page result. The failure of Thompson’s argument shows that to understand the value of functional (...) diversity, we should be clearer about how we conceive of and measure that diversity. (shrink)

n this text, we revisit part of the analysis of anti-entropy in Bailly and Longo (2009} and develop further theoretical reflections. In particular, we analyze how randomness, an essential component of biological variability, is associated to the growth of biological organization, both in ontogenesis and in evolution. This approach, in particular, focuses on the role of global entropy production and provides a tool for a mathematical understanding of some fundamental observations by Gould on the increasing phenotypic complexity along evolution. Lastly, (...) we analyze the situation in terms of theoretical symmetries, in order to further specify the biological meaning of anti-entropy as well as its strong link with randomness. (shrink)

It is known that the box dimension of any Martin-Löf random closed set of ${\{0,1\}^\mathbb{N}}$ is ${\log_2(\frac{4}{3})}$ . Barmpalias et al. [J Logic Comput 17(6):1041–1062, 2007] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for computing the Hausdorff dimension of almost every random closed set of ${\{0,1\}^\mathbb{N}}$ , and propose a general method (...) for random closed sets in other spaces. We further find both the appropriate dimensional Hausdorff measure and the exact Hausdorff dimension for such random closed sets. (shrink)

We investigate notions of randomness in the space ${{\mathcal C}(2^{\mathbb N})}$ of continuous functions on ${2^{\mathbb N}}$ . A probability measure is given and a version of the Martin-Löf test for randomness is defined. Random ${\Delta^0_2}$ continuous functions exist, but no computable function can be random and no random function can map a computable real to a computable real. The image of a random continuous function is always a perfect set and hence uncountable. For any ${y (...) \in 2^{\mathbb N}}$ , there exists a random continuous function F with y in the image of F. Thus the image of a random continuous function need not be a random closed set. The set of zeroes of a random continuous function is always a random closed set. (shrink)

This paper argues, first, that biological evolution can be both random and divinely guided at the same time. Next it discusses the idea that the claim that evolution is unguided is not part of the science of evolution, and defends it against a number of objections.

How realistic is it to adopt a quantum random walk model to account for decisions involving two choices? Here, we discuss the neural plausibility and the effect of initial state and boundary thresholds on such a model and contrast it with various features of the classical random walk model of decision making.

A widely accepted tenet of evolutionary biology is that spontaneous mutations occur randomly with regard to their fitness effect. However, since the mutation rate varies along a genome and this variation can be subject to selection, organisms might evolve lower mutation rates at loci where mutations are most deleterious or increased rates where mutations are most needed. In fact, mechanisms of targeted hypermutation are known in organisms ranging from bacteria to humans. Here we review the main forces driving the evolution (...) of local mutation rates and identify the main limiting factors. Both targeted hyper‐ and hypomutation can evolve, although the former is restricted to loci under very frequent positive selection and the latter is severely limited by genetic drift. Nevertheless, we show how an association of repair with transcription or chromatin‐associated proteins could overcome the drift limit and lead to non‐random hypomutation along the genome in most organisms.Editor's suggested further reading in BioEssays Stress‐induced mutation via DNA breaks in Escherichia coli: A molecular mechanism with implications for evolution and medicine Abstract. (shrink)

Sortition, i.e. random appointment for public duty, has been employed by societies throughout the years as a firewall designated to prevent illegitimate interference between parties in a legal case and agents of the legal system. In judicial systems of modern western countries, random procedures are mainly employed to select the jury, the court and/or the judge in charge of judging a legal case. Therefore, these random procedures play an important role in the course of a case, and (...) should comply with some principles, such as transparency and complete auditability. Nevertheless, these principles are neglected by random procedures in some judicial systems, which are performed in secrecy and are not auditable by the involved parties. The assignment of cases in the Brazilian Supreme Court is an example of such a procedure, for it is performed using procedures unknown to the parties involved in the judicial cases. This article presents a review of how sortition has been historically employed by societies and discusses how Mathematical Statistics may be applied to random procedures of the judicial system, as it has been applied for almost a century on clinical trials, for example. A statistical model for assessing randomness in case assignment is proposed and applied to the Brazilian Supreme Court. As final remarks, guidelines for the development of good randomization procedures are outlined. (shrink)

We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness (...) notions going back to the work of Kurtz [73], Kautz [61], and Solovay [125]; and other calibrations of randomness based on definitions along the lines of Schnorr [117].These notions have complex interrelationships, and connections to classical notions from computability theory such as relative computability and enumerability. Computability figures in obvious ways in definitions of effective randomness, but there are also applications of notions related to randomness in computability theory. For instance, an exciting by-product of the program we describe is a more-or-less naturalrequirement-freesolution to Post's Problem, much along the lines of the Dekker deficiency set. (shrink)

A randomly selected microcosm of the people can usefully play an official role in the lawmaking process. However, there are serious issues to be confronted if such a random sample were to take on the role of a full-scale, full-time second chamber. Some skeptical considerations are detailed. There are also advantages to short convenings of such a sample to take on some of the roles of a second chamber. This article provides a response to the skeptical considerations. Precedents from (...) ancient Athens show how such short-term convenings of a deliberating microcosm can be positioned before, during, or after other elements of the lawmaking process. The article draws on experience from Deliberative Polling to show how this is both practical and productive for the lawmaking process. (shrink)

I discuss recent work in ergodic theory and statistical mechanics, regarding the compatibility and origin of random and chaotic behavior in deterministic dynamical systems. A detailed critique of some quite radical proposals of the Prigogine school is given. I argue that their conclusion regarding the conceptual bankruptcy of the classical conceptions of an exact microstate and unique phase space trajectory is not completely justified. The analogy they want to draw with quantum mechanics is not sufficiently close to support their (...) most radical conclusion. (shrink)

We consider the question of randomness of the probability ΩU[X] that an optimal Turing machine U halts and outputs a string in a fixed set X. The main results are as follows: ΩU[X] is random whenever X is $\Sigma _{n}^{0}$-complete or $\Pi _{n}^{0}$-complete for some n ≥ 2. However, for n ≥ 2, ΩU[X] is not n-random when X is $\Sigma _{n}^{0}$ or $\Pi _{n}^{0}$ Nevertheless, there exists $\Delta _{n+1}^{0}$ sets such that ΩU[X] is n-random. There are (...) $\Delta _{2}^{0}$ sets X such that ΩU[X] is rational. Also, for every n ≥ 1, there exists a set X which is $\Delta _{n+1}^{0}$ and $\Sigma _{n}^{0}$-hard such that ΩU[X] is not random. We also look at the range of ΩU as an operator. We prove that the set {ΩU[X]: X ⊆ 2<ω} is a finite union of closed intervals. It follows that for any optimal machine U and any sufficiently small real r, there is a set X ⊆ 2<ω recursive in ∅′ ⊕ r, such that ΩU[X] = r. The same questions are also considered in the context of infinite computations, and lead to similar results. (shrink)

John organized a state lottery and his wife won the main prize. You may feel that the event of her winning wasn’t particularly random, but how would you argue that in a fair court of law? Traditional probability theory does not even have the notion of random events. Algorithmic information theory does, but it is not applicable to real-world scenarios like the lottery one. We attempt to rectify that.

Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-Löf randomness. After its initial development in the 1970s the notion received considerably less attention than Martin-Löf randomness, but recently interest has increased in a range of randomness concepts. In this article, we explore the properties of Schnorr random reals, and in particular the c.e. Schnorr random reals. We show that there are c.e. reals that are Schnorr random but not Martin-Löf random, (...) and provide a new characterization of Schnorr random real numbers in terms of prefix-free machines. We prove that unlike Martin-Löf random c.e. reals, not all Schnorr random c.e. reals are Turing complete, though all are in high Turing degrees. We use the machine characterization to define a notion of "Schnorr reducibility" which allows us to calibrate the Schnorr complexity of reals. We define the class of "Schnorr trivial" reals, which are ones whose initial segment complexity is identical with the computable reals, and demonstrate that this class has non-computable members. (shrink)

This paper examines the statistical properties of random quantum states, for four different kinds of random state:(1) a pure state chosen at random with respect to the uniform measure on the unit sphere in a finite-dimensional Hilbert space;(2) a random pure state in a real space;(3) a pure state chosen at random except that a certain expectation value is fixed;(4) a random mixed state with fixed eigenvalues. For the first two of these, we give (...) examples of simple states of a model system, the kicked top, which have the statistical properties of random states. Interestingly, examples of both kinds of randomness can be found in the same system. In studying the last two kinds of random state, we obtain new results concerning the application of information theory to quantum systems. (shrink)

According to a traditional view, scientific laws and theories constitute algorithmic compressions of empirical data sets collected from observations and measurements. This article defends the thesis that, to the contrary, empirical data sets are algorithmically incompressible. The reason is that individual data points are determined partly by perturbations, or causal factors that cannot be reduced to any pattern. If empirical data sets are incompressible, then they exhibit maximal algorithmic complexity, maximal entropy and zero redundancy. They are therefore maximally efficient carriers (...) of information about the world. Since, on algorithmic information theory, a string is algorithmically random just if it is incompressible, the thesis entails that empirical data sets consist of algorithmically random strings of digits. Rather than constituting compressions of empirical data, scientific laws and theories pick out patterns that data sets exhibit with a certain noise.Author Keywords: Algorithmic randomness; Compression; Empirical data; Information; Law; Pattern. (shrink)

We examine the randomness and triviality of reals using notions arising from martingales and prefix-free machines.

This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability, and compressibility. Following a philosophical discussion of randomness in general, I argue that deterministic interpretations of quantum mechanics are strictly speaking incompatible with the Born rule. I also stress the role of outliers, i.e. measurement outcomes that are not 1-random. Although these occur with low probability, their very existence implies that the (...) no-signaling principle used in proofs of randomness of outcomes of quantum-mechanical measurements should be reinterpreted statistically, like the second law of thermodynamics. In three appendices I discuss the Born rule and its status in both single and repeated experiments, review the notion of 1-randomness that in various guises was investigated by Kolmogorov and others and treat Bell’s Theorem and the Free Will Theorem with their implications for randomness. (shrink)

We analyze the pointwise convergence of a sequence of computable elements of L1 in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA0, each is equivalent to the assertion that every Gδ subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak Königʼs lemma relativized to the Turing jump of any set. It is also equivalent to the (...) conjunction of the statement asserting the existence of a 2-random relative to any given set and the principle of Σ2 collection. (shrink)

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen’s Theorem fails for both randomnesses. In this paper we define truth-table Schnorr randomness and truth-table reducible randomness, for which we prove that van Lambalgen's Theorem holds. We also show that the classes of truth-table Schnorr random reals relative to a high set contain reals Turing equivalent to the high set. It follows that each high Schnorr random real is half of a real for (...) which van Lambalgen's Theorem fails. Moreover we establish the coincidence between triviality and lowness notions for truth-table Schnorr randomness. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

We consider the nature of quantum randomness and how one might have empirical evidence for it. We will see why, depending on one’s computational resources, it may be impossible to determine whether...

The book is intended to explain the larger and intuitive concept of randomness by means of computation, particularly through algorithmic complexity and recursion theory. It also includes the transcriptions (by A. German) of two panel discussion on the topics: Is The Universe Random?, held at the University of Vermont in 2007; and What is Computation? (How) Does Nature Compute?, held at the University of Indiana Bloomington in 2008. The book is intended to the general public, undergraduate and graduate students (...) in math, computer science, physics and other sciences, but also to philosophers of science and researchers. (shrink)

Demuth tests generalize Martin-Löf tests in that one can exchange the m-th component a computably bounded number of times. A set fails a Demuth test if Z is in infinitely many final versions of the Gm. If we only allow Demuth tests such that GmGm+1 for each m, we have weak Demuth randomness.We show that a weakly Demuth random set can be high and , yet not superhigh. Next, any c.e. set Turing below a Demuth random set is (...) strongly jump-traceable.We also prove a basis theorem for non-empty classes P. It extends the Jockusch–Soare basis theorem that some member of P is computably dominated. We use the result to show that some weakly 2-random set does not compute a 2-fixed point free function. (shrink)

This paper argues, first, that biological evolution can be both random and divinely guided at the same time. Next it discusses the idea that the claim that evolution is unguided is not part of the science of evolution, and defends it against a number of objections.

The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.

It is time for a new paper about open questions in the currently very active area of randomness and computability. Ambos-Spies and Kučera presented such a paper in 1999 [1]. All the question in it have been solved, except for one: is KL-randomness different from Martin-Löf randomness? This question is discussed in Section 6.Not all the questions are necessarily hard—some simply have not been tried seriously. When we think a question is a major one, and therefore likely to be hard, (...) we indicate this by the symbol ▶, the criterion being that it is of considerable interest and has been tried by a number of researchers. Some questions are close contenders here; these are marked by ▷. With few exceptions, the questions are precise. They mostly have a yes/no answer. However, there are often more general questions of an intuitive or even philosophical nature behind. We give an outline, indicating the more general questions.All sets will be sets of natural numbers, unless otherwise stated. These sets are identified with infinite strings over {0, 1}. Other terms used in the literature are sequence and real. (shrink)

Of course, the rationale of PME is so different from what has been taught in “orthodox” statistics courses for fifty years, that it causes conceptual hangups for many with conventional training. But beginning students have no difficulty with it, for it is just a mathematical model of the natural, common sense way in which anybody does conduct his inferences in problems of everyday life.The difficulties that seem so prominent in the literature today are, therefore, only transient phenomena that will disappear (...) automatically in time. Indeed, this revolution in our attitude toward inference is already an accomplished fact among those concerned with a few specialized applications; with a little familarity in its use its advantages are apparent and it no longer seems strange. It is the idea that inference was once thought to be tied to frequencies in random experiments, that will seem strange to future generations. (shrink)

We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0'. This contrasts with a result of Kučera and Terwijn [5] on sets that are low for the class of Martin-Löf random reals.

According to certain interpretations of quantum mechanics, the behavior of some physical systems is random—that is, certain current states of physical systems are related to other current states and the set of possible future states in a probabilistic, rather than a deterministic, fashion. This account of physical systems seems to conflict with the claim that there is an omnipotent God—that is, a God Who can efficaciously bring about any logically possible creaturely state, and Who can cause efficacious secondary causes—and (...) so raises problems for classical theism. After explaining these problems, I provide a solution to them based upon a version of hylomorphism, which I call Theistic Hylomorphism with Randomness. On this view, it can be affirmed that the physical world is both random and in determinate states, and divine omnipotence can be upheld in a random world. After presenting this version of hylomorphism and showing how it defeats the problems for classical theism raised by quantum mechanics, I defend it against three objections. (shrink)

Quantum mechanics (QM) predicts probabilities on the fundamental level which are, via Born probability law, connected to the formal randomness of infinite sequences of QM outcomes. Recently it has been shown that QM is algorithmic 1-random in the sense of Martin–Löf. We extend this result and demonstrate that QM is algorithmic $$\omega$$ -random and generic, precisely as described by the ’miniaturisation’ of the Solovay forcing to arithmetic. This is extended further to the result that QM becomes Zermelo–Fraenkel Solovay (...) random on infinite-dimensional Hilbert spaces. Moreover, it is more likely that there exists a standard transitive ZFC model M, where QM is expressed in reality, than in the universe V of sets. Then every generic quantum measurement adds to M the infinite sequence, i.e. random real $$r\in 2^{\omega }$$, and the model undergoes random forcing extensions M[r]. The entire process of forcing becomes the structural ingredient of QM and parallels similar constructions applied to spacetime in the quantum limit, therefore showing the structural resemblance of both in this limit. We discuss several questions regarding measurability and possible practical applications of the extended Solovay randomness of QM. The method applied is the formalization based on models of ZFC; however, this is particularly well-suited technique to recognising randomness questions of QM. When one works in a constant model of ZFC or in axiomatic ZFC itself, the issues considered here remain hidden to a great extent. (shrink)

This article explores the connection between objective chance and the randomness of a sequence of outcomes. Discussion is focussed around the claim that something happens by chance iff it is random. This claim is subject to many objections. Attempts to save it by providing alternative theories of chance and randomness, involving indeterminism, unpredictability, and reductionism about chance, are canvassed. The article is largely expository, with particular attention being paid to the details of algorithmic randomness, a topic relatively unfamiliar to (...) philosophers. (shrink)