Several philosophers and psychologists have characterized belief in conspiracy theories as a product of irrational reasoning. Proponents of conspiracy theories apparently resist revising their beliefs given disconfirming evidence and tend to believe in more than one conspiracy, even when the relevant beliefs are mutually inconsistent. In this paper, we bring leading views on conspiracy theoretic beliefs closer together by exploring their rationality under a probabilistic framework. We question the claim that the irrationality of conspiracy theoretic beliefs stems from an inadequate (...) response to disconfirming evidence and internal incoherence. Drawing analogies to Lakatosian research programs, we argue that maintaining a core conspiracy belief can be Bayes-rational when it is embedded in a network of auxiliary beliefs, which can be revised to protect the more central belief from disconfirmation. We propose that the irrationality associated with conspiracy belief lies not in a flawed updating method, but in a failure to converge toward wellconfirmed, stable belief networks in the long run. This approach not only reconciles previously disjointed views, but also points toward more specific descriptions of why agents may be prone to adopting beliefs in conspiracy theories. (shrink)

Confabulation is typically understood to be dysfunctional. But this understanding neglects the phenomenon’s potential benefits. In fact, we think that the benefits of non-clinical confabulation provide a better foundation for a general account of confabulation. In this paper, we start from these benefits to develop a social teleological account of confabulation. Central to our account is the idea that confabulation manifests a kind of willful ignorance. By understanding confabulation in this way, we can provide principled explanations for the difference between (...) clinical and non-clinical cases of confabulation and the extent to which confabulation is rational. (shrink)

Fodor argued that learning a concept by hypothesis testing would involve an impossible circularity. I show that Fodor's argument implicitly relies on the assumption that actually φ-ing entails an ability to φ. But this assumption is false in cases of φ-ing by luck, and just such luck is involved in testing hypotheses with the kinds of generative random sampling methods that many cognitive scientists take our minds to use. Concepts thus can be learned by hypothesis testing without circularity, and it (...) is plausible that this is how humans in fact acquire at least some of their concepts. (shrink)

No existing normative decision theory adequately handles risk. Expected Utility Theory is overly restrictive in prohibiting a range of reasonable preferences. And theories designed to accommodate such preferences (for example, Buchak's (2013) Risk‐Weighted Expected Utility Theory) violate the Betweenness axiom, which requires that you are indifferent to randomizing over two options between which you are already indifferent. Betweenness has been overlooked by philosophers, and we argue that it is a compelling normative constraint. Furthermore, neither Expected nor Risk‐Weighted Expected Utility Theory (...) allow for stakes‐sensitive risk‐attitudes—they require that risk matters in the same way whether you are gambling for loose change or millions of dollars. We provide a novel normative interpretation of Weighted‐Linear Utility Theory that solves all of these problems. (shrink)

The gambler’s fallacy is the tendency to expect random processes to switch more often than they actually do—for example, to think that after a string of tails, a heads is more likely. It’s often taken to be evidence for irrationality. It isn’t. Rather, it’s to be expected from a group of Bayesians who begin with causal uncertainty, and then observe unbiased data from an (in fact) statistically independent process. Although they converge toward the truth, they do so in an asymmetric (...) way—ruling out “streaky” hypotheses more quickly than “switchy” ones. As a result, the majority (and the average) exhibit the gambler’s fallacy. If they have limited memory, this tendency persists even with arbitrarily-large amounts of data. Indeed, such Bayesians exhibit a variety of the empirical trends found in studies of the gambler’s fallacy: they expect switches after short streaks but continuations after long ones; these nonlinear expectations vary with their familiarity with the causal system; their predictions depend on the sequence they’ve just seen; they produce sequences that are too switchy; and they exhibit greater rates of gambler’s reasoning when forming binary predictions than when forming probability estimates. In short: what’s been thought to be evidence for irrationality may instead be rational responses to limited data and memory. (shrink)

Theories of rational decision making often abstract away from computational and other resource limitations faced by real agents. An alternative approach known as resource rationality puts such matters front and center, grounding choice and decision in the rational use of finite resources. Anticipated by earlier work in economics and in computer science, this approach has recently seen rapid development and application in the cognitive sciences. Here, the theory of rationality plays a dual role, both as a framework for normative assessment (...) and as a source of scientific hypotheses about how mental processes in fact work. The latter project, often called rational analysis, depends for its success on a fine-grained characterization of the computational problem facing a decision maker, which may in turn depend on realistic assumptions about what the relevant agent is like. As a consequence, resource rationality involves a delicate, but often fruitful interplay between the normative and the descriptive. (shrink)

A probabilistic Chomsky–Schützenberger hierarchy of grammars is introduced and studied, with the aim of understanding the expressive power of generative models. We offer characterizations of the distributions definable at each level of the hierarchy, including probabilistic regular, context-free, (linear) indexed, context-sensitive, and unrestricted grammars, each corresponding to familiar probabilistic machine classes. Special attention is given to distributions on (unary notations for) positive integers. Unlike in the classical case where the "semi-linear" languages all collapse into the regular languages, using analytic tools (...) adapted from the classical setting we show there is no collapse in the probabilistic hierarchy: more distributions become definable at each level. We also address related issues such as closure under probabilistic conditioning. (shrink)