Fodor advocates a view of cognitive processes as computations defined over the language of thought (or Mentalese). Even among those who endorse Mentalese, considerable controversy surrounds its representational format. What semantically relevant structure should scientific psychology attribute to Mentalese symbols? Researchers commonly emphasize logical structure, akin to that displayed by predicate calculus sentences. To counteract this tendency, I discuss computational models of navigation drawn from probabilistic robotics. These models involve computations defined over cognitive maps, which have geometric rather than logical (...) structure. They thereby demonstrate the possibility of rational cognitive processes in an exclusively non-logical representational medium. Furthermore, they offer much promise for the empirical study of animal navigation. (shrink)

Alston, Searle, and Williamson advocate the restrictive model of assertion , according to which certain constitutive assertoric norms restrict which propositions one may assert. Sellars and Brandom advocate the dialectical model of assertion , which treats assertion as constituted by its role in the game of giving and asking for reasons. Sellars and Brandom develop a restrictive version of the dialectical model. I explore a non-restrictive version of the dialectical model. On such a view, constitutive assertoric norms constrain how one (...) must react if an interlocutor challenges one's assertion, but they do not constrain what one should assert in the first place. I argue that the non-restrictive dialectical perspective can accommodate various linguistic phenomena commonly taken to support the restrictive model. 1. (shrink)

Sensorimotor psychology studies the mental processes that control goal-directed bodily motion. Recently, sensorimotor psychologists have provided empirically successful Bayesian models of motor control. These models describe how the motor system uses sensory input to select motor commands that promote goals set by high-level cognition. I highlight the impressive explanatory benefits offered by Bayesian models of motor control. I argue that our current best models assign explanatory centrality to a robust notion of mental representation. I deploy my analysis to defend intentional (...) realism, to rebut eliminativism and instrumentalism regarding mental representation, and to explore the relation between intentionality and normativity. (shrink)

Conditionalization is a norm that governs the rational reallocation of credence. I distinguish between factive and non-factive formulations of Conditionalization. Factive formulations assume that the conditioning proposition is true. Non-factive formulations allow that the conditioning proposition may be false. I argue that non-factive formulations provide a better foundation for philosophical and scientific applications of Bayesian decision theory. I furthermore argue that previous formulations of Conditionalization, factive and non-factive alike, have almost universally ignored, downplayed, or mishandled a crucial causal aspect of (...) Conditionalization. To formulate Conditionalization adequately, one must explicitly address the causal structure of the transition from old credences to new credences. I offer a formulation of Conditionalization that takes these considerations into account, and I compare my preferred formulation with some prominent formulations found in the literature. (shrink)

I argue that maps do not feature predication, as analyzed by Frege and Tarski. I take as my foil (Casati and Varzi, Parts and places, 1999), which attributes predication to maps. I argue that the details of Casati and Varzi’s own semantics militate against this attribution. Casati and Varzi emphasize what I call the Absence Intuition: if a marker representing some property (such as mountainous terrain) appears on a map, then absence of that marker from a map coordinate signifies absence (...) of the corresponding property from the corresponding location. Predication elicits nothing like the Absence Intuition. “F(a)” does not, in general, signify that objects other than a lack property F. On the basis of this asymmetry, I argue that attaching a marker to map coordinates is a different mode of semantic composition than attaching a predicate to a singular term. (shrink)

Many philosophers worry that the classical computational theory of mind (CTM) engenders epiphenomenalism. Building on Block’s (1990) discussion, I formulate a particularly troubling version of this worry. I then present a novel solution to CTM’s epiphenomenalist conundrum. I develop my solution within an interventionist theory of causal relevance. My solution departs substantially from orthodox versions of CTM. In particular, I reject the widespread picture of digital computation as formal syntactic manipulation.1.

I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with mechanical instructions encoded by the model. I contrast my theory with an influential approach to computational implementation espoused by Chalmers, Putnam, and others. I deploy my theory (...) to illuminate the relation between computation and representation. I also rebut arguments, propounded by Putnam and Searle, that computational implementation is trivial. (shrink)

Turing computation over a non-linguistic domain presupposes a notation for the domain. Accordingly, computability theory studies notations for various non-linguistic domains. It illuminates how different ways of representing a domain support different finite mechanical procedures over that domain. Formal definitions and theorems yield a principled classification of notations based upon their computational properties. To understand computability theory, we must recognize that representation is a key target of mathematical inquiry. We must also recognize that computability theory is an intensional enterprise: it (...) studies entities as represented in certain ways, rather than entities detached from any means of representing them. (shrink)

Lewis proved a Dutch book theorem for Conditionalization. The theorem shows that an agent who follows any credal update rule other than Conditionalization is vulnerable to bets that inflict a sure loss. Lewis’s theorem is tailored to factive formulations of Conditionalization, i.e. formulations on which the conditioning proposition is true. Yet many scientific and philosophical applications of Bayesian decision theory require a non-factive formulation, i.e. a formulation on which the conditioning proposition may be false. I prove a Dutch book theorem (...) tailored to non-factive Conditionalization. I also discuss the theorem’s significance. (shrink)

This paper discusses conditional probability $$P$$ P , or the probability of A given B. When $$P>0$$ P > 0 , the ratio formula determines $$P$$ P . When $$P=0$$ P = 0 , the ratio formula breaks down. The Borel–Kolmogorov paradox suggests that conditional probabilities in such cases are indeterminate or ill-posed. To analyze the paradox, I explore the relation between probability and intensionality. I argue that the paradox is a Frege case, similar to those that arise in many (...) probabilistic and non-probabilistic contexts. The paradox vividly illustrates how an agent’s way of representing an entity can rationally influence her credal assignments. I deploy my analysis to defend Kolmogorov’s relativistic treatment of conditional probability. (shrink)

Under what conditions does a physical system implement or realize a computation? Structuralism about computational implementation, espoused by Chalmers and others, holds that a physical system realizes a computation just in case the system instantiates a pattern of causal organization isomorphic to the computation’s formal structure. I argue against structuralism through counter-examples drawn from computer science. On my opposing view, computational implementation sometimes requires instantiating semantic properties that outstrip any relevant pattern of causal organization. In developing my argument, I defend (...) anti-individualism about computational implementation: relations to the social environment sometimes help determine whether a physical system realizes a computation. 1 The Physical Realization Relation2 Semantics and Computational Implementation3 Conforming to Instructions4 Implementing a Computer Program4.1 The denotational semantics of Scheme4.2 Worries about intentionality4.3 Worries about the natural numbers5 Implementing a Machine Model6 Bounded Structuralism7 Triviality Arguments8 Anti-individualism about Computational Implementation. (shrink)

Dialectical foundationalists, including Adler, Brandom, Leite, and Williams, claim that some asserted propositions do not require defense just because an interlocutor challenges them. By asserting such a proposition, the speaker shifts the burden of proof to her interlocutor. Dialectical egalitarians claim that all asserted propositions require defense when challenged. I elucidate the dispute between dialectical foundationalists and egalitarians, and I defend a broadly egalitarian stance against several prominent objections.

I critique an ancient argument for the possibility of non-linguistic deductive inference. The argument, attributed to Chrysippus, describes a dog whose behavior supposedly reflects disjunctive syllogistic reasoning. Drawing on contemporary robotics, I urge that we can equally well explain the dog's behavior by citing probabilistic reasoning over cognitive maps. I then critique various experimentally-based arguments from scientific psychology that echo Chrysippus's anecdotal presentation.

Dialectical egalitarianism holds that every asserted proposition requires defence when challenged by an interlocutor. This view apparently generates a vicious 'regress of justifications', since an interlocutor can challenge the premises through which a speaker defends her original assertion, and so on ad infinitum . To halt the regress, dialectical foundationalists such as Adler, Brandom, Leite, and Williams propose that some propositions require no defence in the light of mere requests for justification. I argue that the putative regress is not worrisome (...) and that egalitarianism can handle it quite satisfactorily. I also defend a positive view that combines an anti-foundationalist conception of dialectical interaction with a foundationalist conception of epistemic justification. (shrink)

This paper discusses how to update one’s credences based on evidence that has initial probability 0. I advance a diachronic norm, Kolmogorov Conditionalization, that governs credal reallocation in many such learning scenarios. The norm is based upon Kolmogorov’s theory of conditional probability. I prove a Dutch book theorem and converse Dutch book theorem for Kolmogorov Conditionalization. The two theorems establish Kolmogorov Conditionalization as the unique credal reallocation rule that avoids a sure loss in the relevant learning scenarios.

The perceptual system estimates distal conditions based upon proximal sensory input. It typically exploits information from multiple cues across and within modalities: it estimates shape based upon visual and haptic cues; it estimates depth based upon convergence, binocular disparity, motion parallax, and other visual cues; and so on. Bayesian models illuminate the computations through which the perceptual system combines sensory cues. I review key aspects of these models. Based on my review, I argue that we should posit co-referring perceptual representations (...) corresponding to distinct sensory cues. For example, the perceptual system represents a distal size using a representation canonically linked with vision and a distinct representation canonically linked with touch. Distinct co-referring perceptual representations represent the same denotation, but they do so under different modes of presentation. Bayesian cue combination models demonstrate that psychological explanation of perception should attend to mode of presentation and not simply to denotation. (shrink)

Church's thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing's work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church's thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing's work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we must correlate these syntactic (...) entities with numbers. I argue that, in providing this correlation, we must demand that the correlation itself be computable. Otherwise, the Turing machine will compute uncomputable functions. But if we presuppose the intuitive notion of a computable relation between syntactic entities and numbers, then our analysis of computability is circular. (shrink)

Interventionism is a theory of causal explanation developed by Woodward and Hitchcock. I defend an interventionist perspective on the causal explanations offered within scientific psychology. The basic idea is that psychology causally explains mental and behavioral outcomes by specifying how those outcomes would have been different had an intervention altered various factors, including relevant psychological states. I elaborate this viewpoint with examples drawn from cognitive science practice, especially Bayesian perceptual psychology. I favorably compare my interventionist approach with well-known nomological and (...) mechanistic theories of psychological explanation. (shrink)

The central philosophical task posed by conventions is to analyze what they are and how they differ from mere regularities of action and cognition. Subsidiary questions include: How do conventions arise? How are they sustained? How do we select between alternative conventions? Why should one conform to convention? What social good, if any, do conventions serve? How does convention relate to such notions as rule, norm, custom, practice, institution, and social contract? Apart from its intrinsic interest, convention is important because (...) philosophers frequently invoke it when discussing other topics. A favorite philosophical gambit is to argue that, perhaps despite appearances to the contrary, some phenomenon ultimately results from convention. Notable candidates include: property, government, justice, law, morality, linguistic meaning, necessity, ontology, mathematics, and logic. (shrink)

The formal conception of computation (FCC) holds that computational processes are not sensitive to semantic properties. FCC is popular, but it faces well-known difficulties. Accordingly, authors such as Block and Peacocke pursue a ?semantically-laden? alternative, according to which computation can be sensitive to semantics. I argue that computation is insensitive to semantics within a wide range of computational systems, including any system with ?derived? rather than ?original? intentionality. FCC yields the correct verdict for these systems. I conclude that there is (...) only one promising strategy for semantically-laden theorists: identify special computational systems that help generate their own semantic properties, and then show that computation within those systems is semantically-laden. Unfortunately, the few existing discussions that pursue this strategy are problematic. (shrink)

Many philosophers contend that Turing’s work provides a conceptual analysis of numerical computability. In (Rescorla, 2007), I dissented. I argued that the problem of deviant notations stymies existing attempts at conceptual analysis. Copeland and Proudfoot respond to my critique. I argue that their putative solution does not succeed. We are still awaiting a genuine conceptual analysis.

This paper further develops the non-restrictive dialectical perspective. Many philosophers hold that truthfulness is somehow constitutive of assertion. I argue against this view while simultaneously attempting to ground truthfulness in assertion’s essential features. I argue that truthfulness is the prima facie best way to avoid decisive counter-arguments against what one says. Moreover, avoiding decisive counter-arguments is a constitutive goal of rational dialectic. Thus, while truthfulness is not constitutive of assertion, it is the rational default strategy for achieving a goal that (...) is constitutive of assertion. (shrink)

A striking thesis lies at the core of Davidson‟s philosophy: when we attribute intentional content to another creature‟s mental states and speech acts, we must treat the creature as largely conforming to our own rational norms. I will discuss how this thesis informs Davidson‟s treatment of rationality and intentionality. After reviewing some historical background, I present basic aspects of Davidson‟s position. I then examine various worries about the position. I conclude by highlighting some key Davidsonian insights into rationality.