Many debates about consciousness appear to be endless, in part because of conceptual confusions preventing clarity as to what the issues are and what does or does not count as evidence. This makes it hard to decide what should go into a machine if it is to be described as 'conscious'. Thus, triumphant demonstrations by some AI developers may be regarded by others as proving nothing of interest because the system does not satisfy *their* definitions or requirements specifications.

Computationalism has been the mainstream view of cognition for decades. There are periodic reports of its demise, but they are greatly exaggerated. This essay surveys some recent literature on computationalism. It concludes that computationalism is a family of theories about the mechanisms of cognition. The main relevant evidence for testing it comes from neuroscience, though psychology and AI are relevant too. Computationalism comes in many versions, which continue to guide competing research programs in philosophy of mind as well as psychology (...) and neuroscience. Although our understanding of computationalism has deepened in recent years, much work in this area remains to be done. (shrink)

Pancomputationalism is the view that everything is a computer. This, if true, poses some difficulties to the computational theory of cognition. In particular, the strongest version of it suggested by John Searle seems enough to trivialize computational cognitivists’ core idea on which our cognitive system is a computing system. The aim of this paper is to argue against Searle’s pancomputationalism. To achieve this, I will draw a line between realized computers and unrealized computers. Through this distinction, I expect that it (...) will become evident that Searle’s pancomputationalism should be understood in terms of unrealized computers, while the computational theory of cognition is concerned with realized computers. (shrink)

The assumption that psychological states and processes are computational in character pervades much of cognitive science, what many call the computational theory of mind. In addition to occupying a central place in cognitive science, the computational theory of mind has also had a second life supporting “individualism”, the view that psychological states should be taxonomized so as to supervene only on the intrinsic, physical properties of individuals. One response to individualism has been to raise the prospect of “wide computational systems”, (...) in which some computational units are instantiated outside the individual. “Wide computationalism” attempts to sever the link between individualism and computational psychology by enlarging the concept of computation. However, in spite of its potential interest to cognitive science, wide computationalism has received little attention in philosophy of mind and cognitive science. This paper aims to revisit the prospect of wide computationalism. It is argued that by appropriating a mechanistic conception of computation wide computationalism can overcome several issues that plague initial formulations. The aim is to show that cognitive science has overlooked an important and viable option in computational psychology. The paper marshals empirical support and responds to possible objections. (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)

Velmans’ paper raises three problems concerning mental causation: (1) How can consciousness affect the physical, given that the physical world appears causally closed? 10 (2) How can one be in conscious control of processes of which one is not consciously aware? (3) Conscious experiences appear to come too late to causally affect the processes to which they most obviously relate. In an appendix Velmans gives his reasons for refusing to resolve these problems through adopting the position (which he labels ‘physicalism’) (...) that ‘consciousness is nothing more than a state of the brain’. The rest of the paper, then, is an attempt to solve these problems without embracing a reductionist physicalism. Velmans’ solution to the first problem is ‘ontological monism combined with epistemological dualism’: First-person and third-person accounts are two different ways of knowing the same facts. This kind of reply is not new; it is, for example, a twist on the position expressed in Davidson (1970). True, there are substantial differences: For one, Davidson reconciles the tension between descriptions of events in mentalistic and physicalist language, not between firstand third-person descriptions of states; for another, Davidson actually provides an argument for his position, although to do so he assumes that there are no psycho-physical (or indeed, psycho-psycho) laws, something which I suspect Velmans would be reluctant to do. Nevertheless, they have in common the idea that the causal efficacy of the mental is not at odds with the causal closure of physics, since a mind-involving causal story is just another way of talking about the same facts that a purely physical causal story talks about. This ‘dual-aspect’ approach is a popular tactic for resolving the mind--body problem, but it has some well-known problems, and it is unfortunate Velmans doesn’t reply to these standard objections. For example, a frequently discussed issue in connection with theories of mental causation is the problem of overdetermination (see, e.g., Unger, 1977; Peacocke, 1979). (shrink)

Putnam (Representations and reality. MIT Press, Cambridge, 1988) and Searle (The rediscovery of the mind. MIT Press, Cambridge, 1992) famously argue that almost every physical system implements every finite computation. This universal implementation claim, if correct, puts at the risk of triviality certain functional and computational views of the mind. Several authors have offered theories of implementation that allegedly avoid the pitfalls of universal implementation. My aim in this paper is to suggest that these theories are still consistent with a (...) weaker result, which is the nomological possibility of systems that simultaneously implement different complex automata. Elsewhere I (Shagrir in J Cogn Sci, 2012) argue that this simultaneous implementation result challenges a computational sufficiency thesis (articulated by Chalmers in J Cogn Sci, 2012). My focus here is on theories of implementation. After presenting the basic simultaneous implementation construction, I argue that these theories do not avoid the simultaneous implementation result. The conclusion is that the idea that the implementation of the right kind of automaton suffices for a possession of a mind is dubious. (shrink)

This paper takes up a recent challenge to mechanistic approaches to computational implementation, the view that computational implementation is best explicated within a mechanistic framework. The challenge, what has been labelled “the abstraction problem”, claims that one of MAC’s central pillars – medium independence – is deeply confused when applied to the question of computational implementation. The concern is that while it makes sense to say that computational processes are abstract (i.e. medium-independent), it makes considerably less sense to say that (...) they are also concrete processes of a mechanism. After outlining the problem and its effect on MAC, I examine a recent response from Kuokkanen and Rusanen [2018. “Making Too Many Enemies: Hutto and Myin’s Attack on Computationalism.” Philosophical Explorations 21 (2): 282–294. doi:10.1080/13869795.2018.1477980]. I argue that Kuokkanen and Rusanen’s response comes up short insofar as it makes problematic trade-offs among various desiderata we have for a theory of implementation. This leads to a general dilemma for MAC: either give up being an objective theory of implementation or concede the abstraction problem and so reintroduce triviality concerns. In response, I argue that conceiving of computations as abstracta rather than illata provides a way to avoid the proposed dilemma and articulate a notion of medium independence that addresses the abstraction problem. (shrink)