Computational explanations focus on information processing required in specific cognitive capacities, such as perception, reasoning or decision-making. These explanations specify the nature of the information processing task, what information needs to be represented, and why it should be operated on in a particular manner. In this article, the focus is on three questions concerning the nature of computational explanations: What type of explanations they are, in what sense computational explanations are explanatory and to what extent they involve a special, “independent” (...) or “autonomous” level of explanation. In this paper, we defend the view computational explanations are genuine explanations, which track non-causal/formal dependencies. Specifically, we argue that they do not provide mere sketches for explanation, in contrast to what for example Piccinini and Craver :283–311, 2011) suggest. This view of computational explanations implies some degree of “autonomy” for the computational level. However, as we will demonstrate that does not make this view “computationally chauvinistic” in a way that Piccinini or Kaplan :339–373, 2011) have charged it to be. (shrink)

ABSTRACTThe seminal work of David Marr, popularized in his classic work Vision, continues to exert a major influence on both cognitive science and philosophy. The interpretation of his work also co...

Tenenbaum and Griffiths (2001) have proposed that their Bayesian model of generalisation unifies Shepard’s (1987) and Tversky’s (1977) similarity-based explanations of two distinct patterns of generalisation behaviours by reconciling them under a single coherent task analysis. I argue that this proposal needs refinement: instead of unifying the heterogeneous notion of psychological similarity, the Bayesian approach unifies generalisation by rendering the distinct patterns of behaviours informationally relevant. I suggest that generalisation as a Bayesian inference should be seen as a complement to, (...) instead of a replacement of, similarity-based explanations. Furthermore, I show that the unificatory powers of the Bayesian model of generalisation can contribute to the selection of one of these models of psychological similarity. (shrink)

Tenenbaum and Griffiths (Behavioral and Brain Sciences 24(4):629–640, 2001) have proposed that their Bayesian model of generalisation unifies Shepard’s (Science 237(4820): 1317–1323, 1987) and Tversky’s (Psychological Review 84(4): 327–352, 1977) similarity-based explanations of two distinct patterns of generalisation behaviours by reconciling them under a single coherent task analysis. I argue that this proposal needs refinement: instead of unifying the heterogeneous notion of psychological similarity, the Bayesian approach unifies generalisation by rendering the distinct patterns of behaviours informationally relevant. I suggest that (...) generalisation as a Bayesian inference should be seen as a complement to, instead of a replacement of, similarity-based explanations. Furthermore, I show that the unificatory powers of the Bayesian model of generalisation can contribute to the selection of one of these models of psychological similarity. (shrink)

The feature-matching approach pioneered by Amos Tversky remains a groundwork for psychological models of similarity and categorization but is rarely explicitly justified considering recent advances in thinking about cognition. While psychologists often view similarity as an unproblematic foundational concept that explains generalization and conceptual thought, long-standing philosophical problems challenging this assumption suggest that similarity derives from processes of higher-level cognition, including inference and conceptual thought. This paper addresses three specific challenges to Tversky’s approach: (i) the feature-selection problem, (ii) the problem (...) of cognitive implausibility, and (iii) the problem of unprincipled tweaking. It subsequently supports key insights from Tversky’s account based on recent developments in Bayesian modeling of cognition. A novel computational view of similarity as inference is proposed that addresses each challenge by considering the contrast class as constitutive of similarity and selecting for highly informative features. In so doing, this view illustrates the ongoing promise of the feature-matching approach in explaining perception, generalization and conceptual thought by grounding them in principles of probabilistic inference. (shrink)

Descriptive abstraction means omission of information from descriptions of phenomena. In this paper, I introduce a distinction between vertical and horizontal descriptive abstraction. Vertical abstracts away levels of mechanism or organization, while horizontal abstracts away details within one level of organization. The distinction is implicit in parts of the literature, but it has received insufficient attention and gone mainly unnoticed. I suggest that the distinction can be used to clarify how computational descriptions are formed in some variants of the mechanistic (...) account of physical computation. Furthermore, I suggest that, if this suggestion is adopted, it can be used to resolve what I call abstraction, hierarchy, and generality problems raised against mechanistic account of physical computation. According to the abstraction problem, the mechanistic account of physical computation is conceptually confused in claiming that physical systems process computational, abstract properties. An existing solution distinguishes between descriptive and metaphysical abstraction, suggesting that the abstraction problem unnecessarily postulates metaphysically abstract entities. The solution has been criticized for leading to what I call hierarchy and generality problems: it results in two separate hierarchies, one physical and one computational, making it problematic both to account for the generality of computational descriptions and to specify how the two hierarchies are related to each other. Adopting the vertical-horizontal distinction and the view that computational descriptions are achieved by horizontal abstraction allows one to account for the generality of computational descriptions, and to form a single hierarchy in which there are no separate hierarchies in need of integration. (shrink)

A single physical process may often be described equally well as computing several different mathematical functions—none of which is explanatorily privileged. How, then, should the computational identity of a physical system be determined? Some computational mechanists hold that computation is individuated only by either narrow physical or functional properties. Even if some individuative role is attributed to environmental factors, it is rather limited. The computational semanticist holds that computation is individuated, at least in part, by semantic properties. She claims that (...) the mechanistic account lacks the resources to individuate the computations performed by some systems, thereby leaving interesting cases of computational indeterminacy unaddressed. This article examines some of these views, and claims that more cases of computational indeterminacy can be addressed, if the system-environment interaction plays a greater role in individuating computations. A new, long-arm functional strategy for individuating computation is advanced. (shrink)