Some regularities enjoy only an attenuated existence in a body of training data. These are regularities whose statistical visibility depends on some systematic recoding of the data. The space of possible recodings is, however, infinitely large – it is the space of applicable Turing machines. As a result, mappings that pivot on such attenuated regularities cannot, in general, be found by brute-force search. The class of problems that present such mappings we call the class of “type-2 problems.” Type-1 problems, by (...) contrast, present tractable problems of search insofar as the relevant regularities can be found by sampling the input data as originally coded. Type-2 problems, we suggest, present neither rare nor pathological cases. They are rife in biologically realistic settings and in domains ranging from simple animat behaviors to language acquisition. Not only are such problems rife – they are standardly solved! This presents a puzzle. How, given the statistical intractability of these type-2 cases, does nature turn the trick? One answer, which we do not pursue, is to suppose that evolution gifts us with exactly the right set of recoding biases so as to reduce specific type-2 problems to type-1 mappings. Such a heavy-duty nativism is no doubt sometimes plausible. But we believe there are other, more general mechanisms also at work. Such mechanisms provide general strategies for managing problems of type-2 complexity. Several such mechanisms are investigated. At the heart of each is a fundamental ploy – namely, the maximal exploitation of states of representation already achieved by prior, simpler learning so as to reduce the amount of subsequent computational search. Such exploitation both characterizes and helps make unitary sense of a diverse range of mechanisms. These include simple incremental learning, modular connectionism, and the developmental hypothesis of “representational redescription”. In addition, the most distinctive features of human cognition – language and culture – may themselves be viewed as adaptations enabling this representation/computation trade-off to be pursued on an even grander scale. (shrink)

That diagrams are analog, i.e., homomorphic, representations of some kind, and sentential representations are not, is a generally held intuition. In this paper, we develop a formal framework in which the claim can be stated and examined, and certain puzzles resolved. We start by asking how physical things can represent information in some target domain. We lay a basis for investigating possible homomorphisms by modeling both the physical medium and the target domain as sets of variables, each with a constraint (...) structure. When a homomorphism exists, the causality of the physical medium can provide a “free ride,” automatically determining the information that is needed to solve a problem. The modeling technique enables us to show how in sentential representations the structure of the 2-D space is used non-homomorphically to define tokens, and to provide a minimal homomorphism with respect to the ordering of the arguments for n-ary functions, predicates, and operators, but otherwise there is no homomorphism with the target domain. Our treatment also characterizes diagrams as a type of a more general class of physical representations in which physical causality plays a role in providing the information needed to solve a problem. (shrink)

Here I consider the relative merits of two recent models of explanation, James Woodward's interventionist-counterfactual model and the model model. According to the former, explanations are largely constituted by information about the consequences of counterfactual interventions. Problems arise for this approach because countless relevant interventions are possible in most cases and because it overlooks other kinds of equally relevant information. According the model model, explanations are largely constituted by cognitive models of actual mechanisms. On this approach, explanations tend not to (...) represent any of the aforementioned information explicitly but can instead be used to produce it on demand. The model model thus offers the more plausible account of the information of which we are aware when we have an explanation and of the ratiocinative process through which we derive many kinds of information that are relevant to the evaluation of explanations. (shrink)

Theories concerning the structure, or format, of mental representation should (1) be formulated in mechanistic, rather than metaphorical terms; (2) do justice to several philosophical intuitions about mental representation; and (3) explain the human capacity to predict the consequences of worldly alterations (i.e., to think before we act). The hypothesis that thinking involves the application of syntax-sensitive inference rules to syntactically structured mental representations has been said to satisfy all three conditions. An alternative hypothesis is that thinking requires the construction (...) and manipulation of the cognitive equivalent of scale models. A reading of this hypothesis is provided that satisfies condition (1) and which, even though it may not fully satisfy condition (2), turns out (in light of the frame problem) to be the only known way to satisfy condition (3). (shrink)

We argue that existing learning algorithms are often poorly equipped to solve problems involving a certain type of important and widespread regularity that we call “type-2 regularity.” The solution in these cases is to trade achieved representation against computational search. We investigate several ways in which such a trade-off may be pursued including simple incremental learning, modular connectionism, and the developmental hypothesis of “representational redescription.”.

We discuss external and internal graphical and linguistic representational systems. We argue that a cognitive theory of peoples' reasoning performance must account for (a) the logical equivalence of inferences expressed in graphical and linguistic form, and (b) the implementational differences that affect facility of inference. Our theory proposes that graphical representation limit abstraction and thereby aid “processibility”. We discuss the ideas of specificity and abstraction, and their cognitive relevance. Empirical support both comes from tasks which involve the manipulation of external (...) graphics and tasks that do not. For the former, we take Euler's (1772) circles, provide a novel computational reconstruction, show how it captures abstractions, and contrast it with earlier construals and with Johnson‐Laird's (1983) mental models representations. We demonstrate equivalence of the graphical Euler system, and the nongraphical mental models system. For tasks not involving manipulation of external graphics, we discuss text comprehension, and the mental performance of syllogisms. By positing an internal system with the same specificity as Euler's circles, we cover the mental models data, and generate new empirical predictions. Finally, we consider how the architecture of working memory explains why such specific representations are relatively easy to store. (shrink)

This paper describes Peirce's systems of logic diagrams, focusing on the so-called ''existential'' graphs, which are equivalent to the first-order predicate calculus. It analyses their implications for the nature of mental representations, particularly mental models with which they have many characteristics in common. The graphs are intended to be iconic, i.e., to have a structure analogous to the structure of what they represent. They have emergent logical consequences and a single graph can capture all the different ways in which a (...) possibility can occur. Mental models share these properties. But, as the graphs show, certain aspects of propositions cannot be represented in an iconic or visualisable way. They include negation, and the representation of possibilities qua possibilities, which both require representations that do not depend on a perceptual modality. Peirce took his graphs to reveal the fundamental operations of reasoning, and the paper concludes with an analysis of different hypotheses about these operations. (shrink)