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)

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 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)

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)

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)

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)

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)

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.

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)

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)

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)

Alexander Rosenberg (1994) claims that the omniscient viewpoint of the evolutionary process would have no need for the concept of random drift. However, his argument fails to take into account all of the processes which are considered to be instances of random drift. A consideration of these processes shows that random drift is not eliminable even given a position of omniscience. Furthermore, Rosenberg must take these processes into account in order to support his claims that evolution is deterministic and that (...) evolutionary biology is an instrumental science. (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.

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)

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)

Chance inevitably plays a role in law but it is not often that we consciously try to import an element of randomness into a legal process. Random Justice: On Lotteries and Legal Decision-Making explores the potential for the use of lotteries in social, and particularly legal, decision-making contexts. Utilizing a variety of disciplines and materials, Neil Duxbury considers in detail the history, advantages, and drawbacks of deciding issues of social significance by lot and argues that the value of the (...) lottery as a legal decision-making device has generally been underestimated. The very fact that there exists widespread resistance to the use of lotteries for legal decision-making purposes betrays a commonly held belief that legal processes are generally more important than are legal outcomes. Where, owing to the existence of indeterminacy, the process of reasoning is likely to be excessively protracted and the reasons provided strongly contestable, the most cost-efficient and impartial decision-making strategy may well be recourse to lot. Aversion to this strategy, while generally understandable, is not necessarily rational. Yet in law, as Professor Duxbury demonstrates, reason is generally valued more highly than is rationality. The lottery is often conceived to be a decision-making device that operates in isolation. Yet lotteries can frequently and profitably be incorporated into other decision-frameworks. The book concludes by controversially considering how lotteries might be so incorporated and also advances the thesis that it may sometimes be sensible to require that adjudication takes place in the shadow of a lottery. (shrink)

Early work on the frequency theory of probability made extensive use of the notion of randomness, conceived of as a property possessed by disorderly collections of outcomes. Growing out of this work, a rich mathematical literature on algorithmic randomness and Kolmogorov complexity developed through the twentieth century, but largely lost contact with the philosophical literature on physical probability. The present chapter begins with a clarification of the notions of randomness and probability, conceiving of the former as a (...) property of a sequence of outcomes, and the latter as a property of the process generating those outcomes. A discussion follows of the nature and limits of the relationship between the two notions, with largely negative verdicts on the prospects for any reduction of one to the other, although the existence of an apparently random sequence of outcomes is good evidence for the involvement of a genuinely chancy process. (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)

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)

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)

A comparison between the standard adiabatic piston dynamics and that of a perfectly conducting (diathermal) piston helps to clarify their different behaviors and, in particular, the anomalously large random displacement of the adiabatic piston as compared to the diathermal one. It is shown to be associated with a situation where the presence of a single massive “particle” (the piston), acting as an internal constraint in a many-particle system, plays a somewhat unexpected relevant role. A significant physical insight accounting for the (...) above difference is gained by means of a simple analysis of the phase space available to our system. (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)

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)

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)

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 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)

Research in evolutionary ecology on random foraging seems to ignore the possibility that some random foraging is an adaptation not to environmental randomness, but to what Wimsatt called “perceived randomness”. This occurs when environmental features are unpredictable, whether physically random or not. Mere perceived randomness may occur, for example, due to effects of climate change or certain kinds of static landscape variation. I argue that an important mathematical model concerning random foraging doesn’t depend on environmental randomness, (...) despite contrary remarks by researchers. I use computer simulations to illustrate the idea that random foraging is an adaptation to mere perceived randomness. (shrink)

Examinations form part of the assessment processes that constitute the basis for benchmarking individual educational progress, and must consequently fulfill credibility, reliability, and transparency standards in order to promote learning outcomes and ensure academic integrity. A randomly selected question examination is considered to be an effective solution to mitigate sharing of questions between students by addressing replicated inter-examination questions that compromise examination integrity and sequential intra- examination questions that compromise examination comprehensivity. In this study, a Monte Carlo approach was used (...) to design six examination schemes for the purpose of generating and evaluating 600 RSQEs in order to investigate the effects of RSQE design on replicated inter-examination and sequential and intra-examination questions. Results revealed that the number of randomly selected questions from the pool and the number of sub-pools inversely affected the replication and sequencing of the examination questions. Thus, by designing the RSQE in many sub-pools, in equivalence to the number of examination questions and selecting only one question from each sub-pool, and updating the sub-pools after each examination, the passing of information can be prevented, ensuring the integrity of the examinations. (shrink)

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)

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.

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)

Random simulation of complex dynamical systems is generally used in order to obtain information about their asymptotic behaviour (i.e., when time or size of the system tends towards infinity). A fortunate and welcome circumstance in most of the systems studied by physicists, biologists, and economists is the existence of an invariant measure in the state space allowing determination of the frequency with which observation of asymptotic states is possible. Regions found between contour lines of the surface density of this invariant (...) measure are called confiners. An example of such confiners is given for a formal neural network capable of learning. Finally, an application of this methodology is proposed in studying dependency of the network's invariant measure with regard to: 1) the mode of neurone updating (parallel or sequential), and 2) boundary conditions of the network (searching for phase transitions). (shrink)

“Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin.”1 John von Neumann’s famous dictum points an accusing finger at all who set their ordered minds to engender disorder. Much as in times past thieves, pimps, and actors carried on their profession with an uneasy conscience, so in this day scientists who devise random number generators suffer pangs of guilt. George Marsaglia, perhaps the preeminent worker in the field, quips when he asks his (...) colleagues, “Who among us has not sinned?” Marsaglia’s work at the Supercomputer Computations Research Institute at Florida State University is well-known. Inasmuch as Marsaglia’s design and testing of random number generators depends on computation, and inasmuch as computation is fundamentally arithmetical, Marsaglia is by von Neumann’s own account a sinner. Working as he does on a supercomputer, Marsaglia is in fact a gross sinner. This he freely admits. Writing of the best random number generators he is aware of, Marsaglia states, “they are the result of arithmetic methods and those using them must, as all sinners must, face Redemption [sic] Day. But perhaps with better understanding we can postpone it.”. (shrink)

A puzzle of an unmarked clock, used by Timothy Williamson to question the KK principle, was separately adapted by David Christensen and Adam Elga to critique a principle of Rational Reflection. Both authors, we argue, flout the received relationship between ideal agency and the classical distinction between systematic and random error, namely that ideal agents are subject only to the latter. As a result, these criticisms miss their mark.

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.

This controversial book explores the potential for the use of lotteries in social, and particularly legal, decision-making contexts. Utilizing a variety of disciplines and materials, the author considers in detail the history, advantages, and drawbacks of deciding issues of social significance by lot and argues that the value of the lottery as a legal decision-making device has generally been underestimated. The final chapter of the book considers how lotteries might be combined with other decision-mechanisms and suggests that it may sometimes (...) be sensible to require that adjudication takes place in the shadow of the lottery. (shrink)

We show that there exists a real α such that, for all reals β, if α is linear reducible to β then β≤Tα. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no ℓ-complete Δ2 real. Upon realizing that quasi-maximality does not characterize the random reals–there exist reals which are not random but which are of quasi-maximal ℓ-degree–it is then natural to ask whether maximality could provide such a characterization. Such hopes, (...) however, are in vain since no real is of maximal ℓ-degree. (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)

Review of John Tyler Bonner: Randomness in Evolution. Princeton University Press, Princeton, 2013, 152 pp, £19.95 hbk, ISBN 978-0-691-15701-6.

We formalise the notion of those infinite binary sequences z that admit a single program P which expresses the entire algorithmical structure of z. Such a program P minimizes the information which must be used in a relative computation for z. We propose two concepts with different strength for this notion, the learnable and the super-learnable sequences. We establish three different equivalent characterizations of learnable (super-learnable, resp.) sequences. In particular, we prove that a sequences z is learnable (super-learnable, resp.) if (...) and only if there is a computable probability measure p such that p is Schnorr (Martin-Lof, resp.) p-random. There is a recursively enumerable sequence which is not learnable. The learnable sequences are invariant with respect to all total and effective transformations of infinite binary sequences. (shrink)

Journal of Political Philosophy, EarlyView.

Mutations are often described as being “random with respect to fitness.” Here we show that the experiments used to establish randomness with respect to fitness are only capable of showing that mutations are random with respect to current external selection. Current debates about whether or not mutations are directed may be at least partially resolved by making use of this distinction. Additionally, this distinction has important mathematical, experimental, and inferential implications.

One can consider μ‐Martin‐Löf randomness for a probability measure μ on 2ω, such as the Bernoulli measure given. We study Bernoulli randomness of sequences in with parameters, and we reintroduce Bernoulli normality, where the uniform distribution of digits is replaced with a Bernoulli distribution. We prove the equivalence of three characterizations of Bernoulli normality. We show that every Bernoulli random real is Bernoulli normal, and this has the corollary that the set of Bernoulli normal reals has full Bernoulli (...) measure in. We give an algorithm for computing Bernoulli normal sequences from normal sequences so that we can give explicit examples of Bernoulli normal reals. We investigate an application of randomness to iterated function systems. Finally, we list a few further questions relating to Bernoulli randomness and Bernoulli normality. (shrink)