•  173
    Some Neural Networks Compute, Others Don't
    Neural Networks 21 (2-3): 311-321. 2008.
    I address whether neural networks perform computations in the sense of computability theory and computer science. I explicate and defend
    the following theses. (1) Many neural networks compute—they perform computations. (2) Some neural networks compute in a classical way.
    Ordinary digital computers, which are very large networks of logic gates, belong in this class of neural networks. (3) Other neural networks
    compute in a non-classical way. (4) Yet other neural networks do not perform computations.…


    Read more
  •  43
    We sketch a framework for building a unified science of cognition. This unification is achieved by showing how functional analyses of cognitive capacities can be integrated with the multilevel mechanistic explanations of neural systems. The core idea is that functional analyses are sketches of mechanisms , in which some structural aspects of a mechanistic explanation are omitted. Once the missing aspects are filled in, a functional analysis turns into a full-blown mechanistic explanation. By thi…Read more
  •  15
    Computation vs. information processing: why their difference matters to cognitive science
    Studies in History and Philosophy of Science Part A 41 (3): 237-246. 2010.
    Since the cognitive revolution, it has become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this paper, we distinguish information processing from computation and examine some of their mutual relations, shedding light on the role each can play in a theory of cognition. We recommend that theoris…Read more
  •  14
    Turing's rules for the imitation game
    Minds and Machines 10 (4): 573-582. 2000.
    In the 1950s, Alan Turing proposed his influential test for machine intelligence, which involved a teletyped dialogue between a human player, a machine, and an interrogator. Two readings of Turing's rules for the test have been given. According to the standard reading of Turing's words, the goal of the interrogator was to discover which was the human being and which was the machine, while the goal of the machine was to be indistinguishable from a human being. According to the literal reading, th…Read more
  •  7
    The following three theses are inconsistent: (1) (Paradigmatic) connectionist systems perform computations. (2) Performing computations requires executing programs. (3) Connectionist systems do not execute programs. Many authors embrace (2). This leads them to a dilemma: either connectionist systems execute programs or they don't compute. Accordingly, some authors attempt to deny (1), while others attempt to deny (3). But as I will argue, there are compelling reasons to accept both (1) and (3). …Read more
  •  14
    Scientific Methods Must Be Public, and Descriptive Experience Sampling Qualifies
    Journal of Consciousness Studies 18 (1): 102-117. 2011.
    I defend three main conclusions. First, whether a method is public is important, because non-public methods are scientifically illegitimate. Second, there are substantive prescriptive differences between the view that private methods are legitimate and the view that private methods are illegitimate. Third, Descriptive Experience Sam-pling is a public method
  •  27
    Access denied to zombies
    Unpublished (1): 1-13. 2008.
    According to the zombie conceivability argument, phenomenal zombies are conceivable, and hence possible, and hence physicalism is false. Critics of the conceivability argument have responded by denying either that zombies are conceivable or that they are possible. Much of the controversy hinges on how to establish and understand what is conceivable, what is possible, and the link between the two—matters that are at least as obscure and controversial as whether consciousness is physical. Becau…Read more