Ira Brevis furor, said the Latins: anger is a brief bout of madness. There is a long tradition that views all emotions as threats to rationality. The crime passionnel belongs to that tradition: in law it is a kind of “brief-insanity defence.” We still say that “passion blinds us;” and in common parlance to be philosophical about life's trials is to be decently unemotional about them. Indeed many philosophers have espoused this view, demanding that Reason conquer Passion. Others — from (...) Hume to the Emotivists — have appeared to reverse this hierarchy.” But those philosophers who refuse to join in the general denigration of emotion as irrational usually share the presupposition that the role of rationality is limited to the calculation of means. In so far as emotions are concerned with the determination of ends, they remain, on this view, beyond the pale of rationality. Modern decision theorists have worked out schemes to assess the rationality of desires, as well as actions, against the background of beliefs and other desires.1 But these schemes leave no room at all for emotions, except, by implication, as disrupters of the rational process. (shrink)

The computational view of mind rests on certain intuitions regarding the fundamental similarity between computation and cognition. We examine some of these intuitions and suggest that they derive from the fact that computers and human organisms are both physical systems whose behavior is correctly described as being governed by rules acting on symbolic representations. Some of the implications of this view are discussed. It is suggested that a fundamental hypothesis of this approach is that there is a natural domain of (...) human functioning that can be addressed exclusively in terms of a formal symbolic or algorithmic vocabulary or level of analysis. Much of the paper elaborates various conditions that need to be met if a literal view of mental activity as computation is to serve as the basis for explanatory theories. The coherence of such a view depends on there being a principled distinction between functions whose explanation requires that we posit internal representations and those that we can appropriately describe as merely instantiating causal physical or biological laws. In this paper the distinction is empirically grounded in a methodological criterion called the " cognitive impenetrability condition." Functions are said to be cognitively impenetrable if they cannot be influenced by such purely cognitive factors as goals, beliefs, inferences, tacit knowledge, and so on. Such a criterion makes it possible to empirically separate the fixed capacities of mind from the particular representations and algorithms used on specific occasions. In order for computational theories to avoid being ad hoc, they must deal effectively with the "degrees of freedom" problem by constraining the extent to which they can be arbitrarily adjusted post hoc to fit some particular set of observations. This in turn requires that the fixed architectural function and the algorithms be independently validated. It is argued that the architectural assumptions implicit in many contemporary models run afoul of the cognitive impenetrability condition, since the required fixed functions are demonstrably sensitive to tacit knowledge and goals. The paper concludes with some tactical suggestions for the development of computational cognitive theories. (shrink)