A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.

Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content is (...) extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

Much of computational cognitive science construes human cognitive capacities as representational capacities, or as involving representation in some way. Computational theories of vision, for example, typically posit structures that represent edges in the distal scene. Neurons are often said to represent elements of their receptive fields. Despite the ubiquity of representational talk in computational theorizing there is surprisingly little consensus about how such claims are to be understood. The point of this chapter is to sketch an account of the nature (...) and function of representation in computational cognitive models. (shrink)

Perceptual systems respond to proximal stimuli by forming mental representations of distal stimuli. A central goal for the philosophy of perception is to characterize the representations delivered by perceptual systems. It may be that all perceptual representations are in some way proprietarily perceptual and differ from the representational format of thought (Dretske 1981; Carey 2009; Burge 2010; Block ms.). Or it may instead be that perception and cognition always trade in the same code (Prinz 2002; Pylyshyn 2003). This paper rejects (...) both approaches in favor of perceptual pluralism, the thesis that perception delivers a multiplicity of representational formats, some proprietary and some shared with cognition. The argument for perceptual pluralism marshals a wide array of empirical evidence in favor of iconic (i.e., image-like, analog) representations in perception as well as discursive (i.e., language-like, digital) perceptual object representations. (shrink)

We analyse Hutto & Myin's three arguments against computationalism [Hutto, D., E. Myin, A. Peeters, and F. Zahnoun. Forthcoming. “The Cognitive Basis of Computation: Putting Computation In Its Place.” In The Routledge Handbook of the Computational Mind, edited by M. Sprevak, and M. Colombo. London: Routledge.; Hutto, D., and E. Myin. 2012. Radicalizing Enactivism: Basic Minds Without Content. Cambridge, MA: MIT Press; Hutto, D., and E. Myin. 2017. Evolving Enactivism: Basic Minds Meet Content. Cambridge, MA: MIT Press]. The Hard Problem (...) of Content targets computationalism that relies on semantic notion of computation, claiming that it cannot account for the natural origins of content. The Intentionality Problem is targeted against computationalism using non-semantic accounts of computation, arguing that it fails in explaining intentionality. Theion Problem claims that causal interaction between concrete physical processes and abstract computational properties is problematic. We argue that these a... (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)

Among the cognitive capacities of evolved creatures is the capacity to represent. Theories in cognitive neuroscience typically explain our manifest representational capacities by positing internal representations, but there is little agreement about how these representations function, especially with the relatively recent proliferation of connectionist, dynamical, embodied, and enactive approaches to cognition. In this talk I sketch an account of the nature and function of representation in cognitive neuroscience that couples a realist construal of representational vehicles with a pragmatic account of (...) mental content. I call the resulting package a deflationary account of mental representation and I argue that it avoids the problems that afflict competing accounts. (shrink)

Over the past thirty years, it is been common to hear the mind likened to a digital computer. This essay is concerned with a particular philosophical view that holds that the mind literally is a digital computer (in a specific sense of “computer” to be developed), and that thought literally is a kind of computation. This view—which will be called the “Computational Theory of Mind” (CTM)—is thus to be distinguished from other and broader attempts to connect the mind with computation, (...) including (a) various enterprises at modeling features of the mind using computational modeling techniques, and (b) employing some feature or features of production-model computers (such as the stored program concept, or the distinction between hardware and software) merely as a guiding metaphor for understanding some feature of the mind. This entry is therefore concerned solely with the Computational Theory of Mind (CTM) proposed by Hilary Putnam [1961] and developed most notably for philosophers by Jerry Fodor [1975, 1980, 1987, 1993]. The senses of ‘computer’ and ‘computation’ employed here are technical; the main tasks of this entry will therefore be to elucidate: (a) the technical sense of ‘computation’ that is at issue, (b) the ways in which it is claimed to be applicable to the mind, (c) the philosophical problems this understanding of the mind is claimed to solve, and (d) the major criticisms that have accrued to this view. (shrink)

A comprehensive introduction to the Language of Though Hypothesis (LOTH) accessible to general audiences. LOTH is an empirical thesis about thought and thinking. For their explication, it postulates a physically realized system of representations that have a combinatorial syntax (and semantics) such that operations on representations are causally sensitive only to the syntactic properties of representations. According to LOTH, thought is, roughly, the tokening of a representation that has a syntactic (constituent) structure with an appropriate semantics. Thinking thus consists in (...) syntactic operations defined over representations. Most of the arguments for LOTH derive their strength from their ability to explain certain empirical phenomena like productivity, systematicity of thought and thinking. (shrink)

Some theories are alleged to be implausible because they are committed to systematic ‘overdetermination’. In response, some authors defend ‘compatibilism’: the view that the putative overdetermination is benign, like other unproblematic cases of a single effect having many sufficient causes. The literature has tended to focus on the following question: which relations between sufficient causes of a single effect ensure that problematic overdetermination is avoided? This paper argues that several widely endorsed answers to this question are subject to counterexample. It (...) then proposes a diagnosis of this failure: the standard answers neglect what really matters––how the causes are connected to their shared effect. In particular, overdetermination is avoided when there are no independent causal connections. (shrink)

The present paper looks at one of the most thorough articles on the intelligence of GPT, research conducted by engineers at Microsoft. Although there is a great deal of value in their work, I will argue that, for familiar philosophical reasons, their methodology, ‘Black-box Interpretability’ is wrongheaded. But there is a better way. There is an exciting and emerging discipline of ‘Inner Interpretability’ (also sometimes called ‘White-box Interpretability’) that aims to uncover the internal activations and weights of models in order (...) to understand what they represent and the algorithms they implement. In my view, a crucial mistake in Black-box Interpretability is the failure to appreciate that how processes are carried out matters when it comes to intelligence and understanding. I can’t pretend to have a full story that provides both necessary and sufficient conditions for being intelligent, but I do think that Inner Interpretability dovetails nicely with plausible philosophical views of what intelligence requires. So the conclusion is modest, but the important point in my view is seeing how to get the research on the right track. Towards the end of the paper, I will show how some of the philosophical concepts can be used to further refine how Inner Interpretability is approached, so the paper helps draw out a profitable, future two-way exchange between Philosophers and Computer Scientists. (shrink)

Nowadays, philosophers and scientists tend to agree that, even though human and artificial intelligence work quite differently, they can still illuminate aspects of each other, and knowledge in one domain can inspire progress in the other. For instance, the notion of “artificial” or “synthetic” phenomenology has been gaining some traction in recent AI research. In this paper, we ask the question: what (if anything) is the use of thinking about phenomenology in the context of AI, and in particular machine learning? (...) We will isolate one sense of “phenomenology”, namely the sense in which it is commonly understood within analytic philosophy of perception. Then, we will give examples of projects within sensory substitution and restoration science that rely heavily on machine learning and to which, according to us, phenomenology in the sense specified makes a relevant contribution. Finally, we will shed some light on what this contribution looks like and why it is important. (shrink)

Structuralism about mathematical objects and structuralist accounts of physical computation both face indeterminacy objections. For the former, the problem arises for cases such as the complex roots i and \, for which a automorphism can be defined, thus establishing the structural identity of these importantly distinct mathematical objects. In the case of the latter, the problem arises for logical duals such as AND and OR, which have invertible structural profiles :369–400, 2001). This makes their physical implementations indeterminate, in the sense (...) that their structural profiles alone cannot establish whether a given physical component is an AND-gate or an OR-gate. Doherty has recently shown both problems to be analogous, and has argued that computational structuralism is threatened with the absurd conclusion that computational digits might be indiscernible, such that, if structural properties are all that we have to go on, the binary digit 0 must be treated as identical to the binary digit 1. However, we think that a solution to the indiscernibility problem for mathematical structuralists, drawing on the work of David Hilbert, can be adapted for the analogous problem in the computational case, thereby rescuing the structuralist approach to physical computation. (shrink)

Naturalist theories of representation have been attacked on the grounds of being too liberal on the minimal conditions for intentionality: they treat several states that are not representational as genuine representations. Behind this attack lies the problem of demarcation: what are the minimal conditions for intentionality that a state should satisfy to be genuinely representational? What are the limits of intentionality? This paper develops a dual proposal to solve this problem. First, I defend the explanatory role criterion in order to (...) assess proposals of minimal conditions for intentionality. I start by proposing the success pattern condition: a state represents a given external feature provided that there is a success pattern present in the behavioural output, and the system uses this state as a proxy for the presence of this external feature. However, this condition is not sufficient for minimal intentionality – there are both intentional and non-intentional success patterns. Another minimal condition is, hence, required to draw this distinction. I propose the constancy mechanism condition: a state is representational provided that the system employs a constancy mechanism in its production. The success pattern and constancy mechanism conditions jointly constitute the dual proposal for minimal intentionality. I argue that this proposal is explanatorily justified and, so, properly demarcates the limits of intentionality. (shrink)

I show that the indeterminacy problem for computational structuralists is in fact far more problematic than even the harshest critic of structuralism has realised; it is not a bullet which can be bitten by structuralists as previously thought. Roughly, this is because the structural indeterminacy of logic-gates such as AND/OR is caused by the structural identity of the binary computational digits 0/1 themselves. I provide a proof that pure computational structuralism is untenable because structural indeterminacy entails absurd consequences - namely, (...) that there is only one binary computational digit. I conclude that accounting for individuation is a more important desiderata for a theory of computation than even that of triviality. -/- . (shrink)

The purpose of this paper is to present a general mechanistic framework for analyzing causal representational claims, and offer a way to distinguish genuinely representational explanations from those that invoke representations for honorific purposes. It is usually agreed that rats are capable of navigation because they maintain a cognitive map of their environment. Exactly how and why their neural states give rise to mental representations is a matter of an ongoing debate. I will show that anticipatory mechanisms involved in rats’ (...) evaluation of possible routes give rise to satisfaction conditions of contents, and this is why they are representationally relevant for explaining and predicting rats’ behavior. I argue that a naturalistic account of satisfaction conditions of contents answers the most important objections of antirepresentationalists. (shrink)

According to the semantic view of computation, computations cannot be individuated without invoking semantic properties. A traditional argument for the semantic view is what we shall refer to as the argument from the cognitive science practice. In its general form, this argument rests on the idea that, since cognitive scientists describe computations (in explanations and theories) in semantic terms, computations are individuated semantically. Although commonly invoked in the computational literature, the argument from the cognitive science practice has never been discussed (...) in detail. In this paper, we shall provide a critical reconstruction of this argument and an extensive analysis of its prospects, taking into account some ways of defending it that have never been explored so far. We shall argue that explanatory considerations support at best a weak version of the argument from the cognitive science practice, according to which semantic properties concur with formal syntactic properties in individuating computations in cognitive science, but not a strong version, according to which computation individuation in cognitive science is semantic as opposed to formal syntactic. (shrink)

ABSTRACTWhile over the last few decades AI research has largely focused on building tools and applications, recent technological developments have prompted a resurgence of interest in building a genuinely intelligent artificial agent – one that has a mind in the same sense that humans and animals do. In this paper, I offer a theoretical and methodological framework for this project of investigating “artificial minded intelligence” that can help to unify existing approaches and provide new avenues for research. I first outline (...) three desiderata that a framework for AMI research should satisfy. In Section 1, I further motivate the desiderata as well as the need for a new framework. Section 2 develops a general methodological approach, the “generative methodology,” and Section 3 develops a version of this methodology, the “Competence Framework for AI research”. (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)

Philosophical Issues, Volume 30, Issue 1, Page 86-101, October 2020.