David Chalmers

1. I think that by emphasizing theoretical spaces of representations, Andy has put his finger on an issue that is key to connectionism's success, and whose investigation will be a key determinant of the field's further progress. I also think that if we look at representational spaces in the right way, we can see that they are deeply related to classical phenomenon of systematicity in representation. I want to argue that the key to understanding representational spaces, and in particular their ability to capture the deep organization underlying various problems, lies in the idea of what I will call.

To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The implementation relation is non-vacuous, so that criticisms by Searle and others fail. This account of computation can be extended to justify the foundational role of computation in artificial intelligence and cognitive science.

Graeme Forbes (2011) raises some problems for two-dimensional semantic theories. The problems concern nested environments: linguistic environments where sentences are nested under both modal and epistemic operators. Closely related problems involving nested environments have been raised by Scott Soames (2005) and Josh Dever (2007). Soames goes so far as to say that nested environments pose the “chief technical problem” for strong two-dimensionalism. We call the problem of handling nested environments within two-dimensional semantics “the nesting problem”. We show that the two-dimensional semantics for attitude ascriptions developed in Chalmers (2011a) has no trouble accommodating certain forms of the nesting problem that involve factive verbs such as “know” or “establish”. A certain form of the nesting problem involving apriority and necessity operators does raise an interesting puzzle, but we show how a generalized version of the nesting problem arises independently of two-dimensional semantics—it arises, in fact, for anyone who accepts the contingent a priori. We, then, provide a two-dimensional treatment of the apriority operator that fits the two-dimensional treatment of attitude verbs and apply it to the generalized nesting problem. We conclude that two-dimensionalism is not seriously threatened by cases involving the nesting of epistemic and modal operators.

It is fairly well-known that certain hard computational problems (that is, 'difficult' problems for a digital processor to solve) can in fact be solved much more easily with an analog machine. This raises questions about the true nature of the distinction between analog and digital computation (if such a distinction exists). I try to analyze the source of the observed difference in terms of (1) expanding parallelism and (2) more generally, infinite-state Turing machines. The issue of discreteness vs continuity will also be touched upon, although it is not so important for analyzing these particular problems.