Clark has recently suggested that predictive processing advances a theory of neural function with the resources to put an ecumenical end to the “representation wars” of recent cognitive science. In this paper I defend and develop this suggestion. First, I broaden the representation wars to include three foundational challenges to representational cognitive science. Second, I articulate three features of predictive processing’s account of internal representation that distinguish it from more orthodox representationalist frameworks. Specifically, I argue that it posits a resemblance-based (...) representational architecture with organism-relative contents that functions in the service of pragmatic success, not veridical representation. Finally, I argue that internal representation so understood is either impervious to the three anti-representationalist challenges I outline or can actively embrace them. (shrink)

According to the dominant computational approach in cognitive science, cognitive agents are digital computers; according to the alternative approach, they are dynamical systems. This target article attempts to articulate and support the dynamical hypothesis. The dynamical hypothesis has two major components: the nature hypothesis (cognitive agents are dynamical systems) and the knowledge hypothesis (cognitive agents can be understood dynamically). A wide range of objections to this hypothesis can be rebutted. The conclusion is that cognitive systems may well be dynamical systems, (...) and only sustained empirical research in cognitive science will determine the extent to which that is true. (shrink)

If we are to preserve qualia, one possibility is to take the current academic, philosophical, and theoretical notion less seriously and current natural science and some pre-theoretical intuitions about qualia more seriously. Dennett (1997) is instrumental in showing how ideas of the intrinsicalness and privacy of qualia are misguided and those of ineffability and immediacy misinterpreted. However, by combining ideas of non-mechanicalness used in contemporary natural science with the pre-theoretical idea that qualia are special because they are unique, we get (...) a notion of qualia that is acceptable to naturalistic philosophy. The notion of unique qualia is not opposed to the idea that some of the characterizations of qualia have to be qualified. It is the folk-philosophical, academic, notions of theoreticity and conceptuality that have to be modified. (shrink)

In this paper we discuss the new Tweety puzzle. The original Tweety puzzle was addressed by approaches in non-monotonic logic, which aim to adequately represent the Tweety case, namely that Tweety is a penguin and, thus, an exceptional bird, which cannot fly, although in general birds can fly. The new Tweety puzzle is intended as a challenge for probabilistic theories of epistemic states. In the first part of the paper we argue against monistic Bayesians, who assume that epistemic states can (...) at any given time be adequately described by a single subjective probability function. We show that monistic Bayesians cannot provide an adequate solution to the new Tweety puzzle, because this requires one to refer to a frequency-based probability function. We conclude that monistic Bayesianism cannot be a fully adequate theory of epistemic states. In the second part we describe an empirical study, which provides support for the thesis that monistic Bayesianism is also inadequate as a descriptive theory of cognitive states. In the final part of the paper we criticize Bayesian approaches in cognitive science, insofar as their monistic tendency cannot adequately address the new Tweety puzzle. We, further, argue against monistic Bayesianism in cognitive science by means of a case study. In this case study we show that Oaksford and Chater’s (2007, 2008) model of conditional inference—contrary to the authors’ theoretical position—has to refer also to a frequency-based probability function. (shrink)

The uncertainty associated with paradigmatic families has been shown to correlate with their phonetic characteristics in speech, suggesting that representations of complex sublexical relations between words are part of speaker knowledge. To better understand this, recent studies have used two-layer neural network models to examine the way paradigmatic uncertainty emerges in learning. However, to date this work has largely ignored the way choices about the representation of inflectional and grammatical functions in models strongly influence what they subsequently learn. To explore (...) the consequences of this, we investigate how representations of IFS in the input-output structures of learning models affect the capacity of uncertainty estimates derived from them to account for phonetic variability in speech. Specifically, we examine whether IFS are best represented as outputs to neural networks or as inputs by building models that embody both choices and examining their capacity to account for uncertainty effects in the formant trajectories of word final [ɐ], which in German discriminates around sixty different IFS. Overall, we find that formants are enhanced as the uncertainty associated with IFS decreases. This result dovetails with a growing number of studies of morphological and inflectional families that have shown that enhancement is associated with lower uncertainty in context. Importantly, we also find that in models where IFS serve as inputs—as our theoretical analysis suggests they ought to—its uncertainty measures provide better fits to the empirical variance observed in [ɐ] formants than models where IFS serve as outputs. This supports our suggestion that IFS serve as cognitive cues during speech production, and should be treated as such in modeling. It is also consistent with the idea that when IFS serve as inputs to a learning network. This maintains the distinction between those parts of the network that represent message and those that represent signal. We conclude by describing how maintaining a “signal-message-uncertainty distinction” can allow us to reconcile a range of apparently contradictory findings about the relationship between articulation and uncertainty in context. (shrink)

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The framework we introduce here, Gradient Symbol Processing, characterizes the emergence of grammatical macrostructure from the Parallel Distributed Processing microstructure (McClelland, Rumelhart, & The PDP Research Group, 1986) of language processing. The mental representations that emerge, Distributed Symbol Systems, (...) have both combinatorial and gradient structure. They are processed through Subsymbolic Optimization–Quantization, in which an optimization process favoring representations that satisfy well-formedness constraints operates in parallel with a distributed quantization process favoring discrete symbolic structures. We apply a particular instantiation of this framework, λ-Diffusion Theory, to phonological production. Simulations of the resulting model suggest that Gradient Symbol Processing offers a way to unify accounts of grammatical competence with both discrete and continuous patterns in language performance. (shrink)

Reception of the Bohm-Hiley interpretation of quantum mechanics has a curiously Janus faced quality. On the one hand, it is frequently derided as a conservative throwback to outdated classical patterns of thought. On the other hand, it is equally often taken to task for encouraging a wild quantum mysticism, often regarded as anti-scientific. I will argue that there are reasons for this reception, but that a proper appreciation of the dual scientific and philosophical aspects of the view reveals a powerful (...) and extremely interesting metaphysical view of the world. This view is akin to that of Russellian Monism, in which the empirical world studied by science is restricted to relational features that stand in need of some background intrinsic properties to ground their reality. This allows for a theory that can embrace a world which exhibits a reasonable and plausible sort of emergence (especially of domains that fall under classical concepts) while also making room for distinctive and scientifically intransigent properties such as consciousness. (shrink)

Using four examples of models and computer simulations from the history of psychology, I discuss some of the methodological aspects involved in their construction and use, and I illustrate how the existence of a model can demonstrate the viability of a hypothesis that had previously been deemed impossible on a priori grounds. This shows a new way in which scientists can learn from models that extends the analysis of Morgan (1999), who has identified the construction and manipulation of models as (...) those phases in which learning from models takes place. (shrink)

Approach and avoidance motivation may represent important explanatory constructs in understanding how individuals differ. Such constructs have primarily been assessed in self-reported terms, but there are limitations to self-reports of motivation. Accordingly, the present review concentrates on the potential utility of implicit cognitive-behavioral probes of approach and avoidance motivation in modeling and understanding individual differences. The review summarizes multiple lines of research that have documented the utility of such probes to the personality-processing interface. Although multiple gaps in our knowledge exist, (...) and are acknowledged, the value of such implicit cognitive-behavioral assessments is emphasized both in modeling multiple subcomponents of approach and avoidance motivation and in showing that such tendencies matter in ways that transcend momentary experiences or manipulations. (shrink)

We begin by distinguishing computationalism from a number of other theses that are sometimes conflated with it. We also distinguish between several important kinds of computation: computation in a generic sense, digital computation, and analog computation. Then, we defend a weak version of computationalism—neural processes are computations in the generic sense. After that, we reject on empirical grounds the common assimilation of neural computation to either analog or digital computation, concluding that neural computation is sui generis. Analog computation requires continuous (...) signals; digital computation requires strings of digits. But current neuroscientific evidence indicates that typical neural signals, such as spike trains, are graded like continuous signals but are constituted by discrete functional elements (spikes); thus, typical neural signals are neither continuous signals nor strings of digits. It follows that neural computation is sui generis. Finally, we highlight three important consequences of a proper understanding of neural computation for the theory of cognition. First, understanding neural computation requires a specially designed mathematical theory (or theories) rather than the mathematical theories of analog or digital computation. Second, several popular views about neural computation turn out to be incorrect. Third, computational theories of cognition that rely on non-neural notions of computation ought to be replaced or reinterpreted in terms of neural computation. (shrink)

This paper offers an account of what it is for a physical system to be a computing mechanism—a system that performs computations. A computing mechanism is a mechanism whose function is to generate output strings from input strings and (possibly) internal states, in accordance with a general rule that applies to all relevant strings and depends on the input strings and (possibly) internal states for its application. This account is motivated by reasons endogenous to the philosophy of computing, namely, doing (...) justice to the practices of computer scientists and computability theorists. It is also an application of recent literature on mechanisms, because it assimilates computational explanation to mechanistic explanation. The account can be used to individuate computing mechanisms and the functions they compute and to taxonomize computing mechanisms based on their computing power. (shrink)

In this paper I shall describe the symbolic search space paradigm which is the dominant model for most of AI. Coupled with the mechanisms of logic it yields the predominant methodology underlying expert systems which are the most successful application of AI technology to date. Human decision making, more precisely, expert human decision making is the function that expert systems aspire to emulate, if not surpass.Expert systems technology has not yet proved to be a decisive success — it appears to (...) fare better in some areas of human expertise than others. As a result subdomains of human expertise are variously categorised and we shall examine a few of the suggested classification schemes. A particular line of argument explored is one which maintains that certain types of human decision making, at least, are not adequately approximated by the symbolic search space paradigm of AI. Furthermore, attempts to project this inadequate model of human decision making via implementations of expert systems will be detrimental to both our image of ourselves and the future possibilities for AI software.Finally, we examine one possible route to the realization of AI, perhaps even practical applications of AI, that is a significant alternative to the model offered by the symbolic search space paradigm. (shrink)

Dienes and Seth (2010) conclude that confidence ratings and post-decision wagering are two comparable and recommendable measures of conscious experience. In a recently submitted paper, we have however found that both methods are problematic and seem less suited to measure consciousness than a direct introspective measure. Here, we discuss the methodology and conclusions put forward by Dienes and Seth, and why we think the two experiments end up with so different recommendations.

Recent controversies about the level of replicability of behavioral research analyzed using statistical inference have cast interest in developing more efficient techniques for analyzing the results of psychological experiments. Here we claim that complementing the analytical workflow of psychological experiments with Machine Learning-based analysis will both maximize accuracy and minimize replicability issues. As compared to statistical inference, ML analysis of experimental data is model agnostic and primarily focused on prediction rather than inference. We also highlight some potential pitfalls resulting from (...) adoption of Machine Learning based experiment analysis. If not properly used it can lead to over-optimistic accuracy estimates similarly observed using statistical inference. Remedies to such pitfalls are also presented such and building model based on cross validation and the use of ensemble models. ML models are typically regarded as black boxes and we will discuss strategies aimed at rendering more transparent the predictions. (shrink)

One of the principal tasks Dennett sets himself in Consciousness Explained is to demolish the Cartesian theater model of phenomenal consciousness, which in its contemporary garb takes the form of Cartesian materialism: the idea that conscious experience is a process of presentation realized in the physical materials of the brain. The now standard response to Dennett is that, in focusing on Cartesian materialism, he attacks an impossibly naive account of consciousness held by no one currently working in cognitive science or (...) the philosophy of mind. Our response is quite different. We believe that, once properly formulated, Cartesian materialism is no straw man. Rather, it is an attractive hypothesis about the relationship between the computational architecture of the brain and phenomenal consciousness, and hence one that is worthy of further exploration. Consequently, our primary aim in this paper is to defend Cartesian materialism from Dennett’s assault. We do this by showing that Dennett’s argument against this position is founded on an implicit assumption (about the relationship between phenomenal experience and information coding in the brain), which while valid in the context of classical cognitive science, is not forced on connectionism. (shrink)

It is an old and venerable idea in philosophy that morality is built into us, and this nativist view has seen a resurgence of late. Indeed, the prevailing systematic account of how we acquire complex moral representations is a nativist view inspired by arguments in Chomskyan linguistics. In this article, I review the leading argument for moral nativism – the poverty of the moral stimulus. I defend a systematic empiricist alternative that draws on the resources of statistical learning. Such an (...) empiricist account, I argue, promises to explain much of the complexity of people’s moral and other normative attitudes. (shrink)

Name der Zeitschrift: Cognitive Linguistics Jahrgang: 27 Heft: 4 Seiten: 507-526.

. This paper offers a survey of the current state of Artificial Intelligence and Law, and makes recommendations for future research. Two main areas of investigation are discussed: the practical work on intelligent legal information systems, and the theoretical work on computational models of legal reasoning. In both areas, the knowledge representation problem is identified as the most important issue facing this field.

It has been argued that neural networks and other forms of analog computation may transcend the limits of Turing-machine computation; proofs have been offered on both sides, subject to differing assumptions. In this article I argue that the important comparisons between the two models of computation are not so much mathematical as epistemological. The Turing-machine model makes assumptions about information representation and processing that are badly matched to the realities of natural computation (information representation and processing in or inspired by (...) natural systems). This points to the need for new models of computation addressing issues orthogonal to those that have occupied the traditional theory of computation. (shrink)

The philosophy of information (PI) is a new area of research with its own field of investigation and methodology. This article, based on the Herbert A. Simon Lecture of Computing and Philosophy I gave at Carnegie Mellon University in 2001, analyses the eighteen principal open problems in PI. Section 1 introduces the analysis by outlining Herbert Simon's approach to PI. Section 2 discusses some methodological considerations about what counts as a good philosophical problem. The discussion centers on Hilbert's famous analysis (...) of the central problems in mathematics. The rest of the article is devoted to the eighteen problems. These are organized into five sections: problems in the analysis of the concept of information, in semantics, in the study of intelligence, in the relation between information and nature, and in the investigation of values. (shrink)

The focus on discourse and communication in the recent sociology of scientific knowledge offers new perspectives for an integration of qualitative and quantitative approaches in science studies. The common point of interest is the question of how reflexive communication systems communicate. The elaboration of the mathematical theory of communication into a theory of potentially self-organizing entropical systems enables us to distinguish the various layers of communication, and to specify the dynamic changes in these configurations over time. For example, a paradigmatic (...) discourse can be considered as a virtual communication system at the supra-individual level. Communication systems, however, cannot be directly observed. One observes only their instantaneous operations. The reflexive analyst is able to attribute the observed uncertainty to hypothesized systems that interact in the events. The implications of this perspective for various programmes in the sociology of scientific knowledge are discussed. (shrink)

A rule-based expert system is demonstrated to have both a symbolic computational network representation and a sub-symbolic connectionist representation. These alternate views enhance the usefulness of the original system by facilitating introduction of connectionist learning methods into the symbolic domain. The connectionist representation learns and stores metaknowledge in highly connected subnetworks and domain knowledge in a sparsely connected expert network superstructure. The total connectivity of the neural network representation approximates that of real neural systems and hence avoids scaling and memory (...) stability problems associated with other connectionist models. (shrink)

I defend a model of the musically extended mind. I consider how acts of “musicking” grant access to novel emotional experiences otherwise inaccessible. First, I discuss the idea of “musical affordances” and specify both what musical affordances are and how they invite different forms of entrainment. Next, I argue that musical affordances – via soliciting different forms of entrainment – enhance the functionality of various endogenous, emotiongranting regulative processes, drawing novel experiences out of us with an expanded complexity and phenomenal (...) character. I argue that music therefore ought to be thought of as part of the vehicle needed to realize these emotional experiences. I appeal to different sources of empirical work to develop this idea. (shrink)

This paper analyses the impact of representation and search operators on Computational Complexity. A model of computation is introduced based on a directed graph, and representation and search are defined to be the vertices and edges of this graph respectively. Changing either the representation or the search algorithm leads to different possible complexity classes. The final section explores the role of representation in reducing time complexity in Artificial Intelligence.

The Sparse, Distributed Memory (SDM) model (Kanerva, 1984) is compared to Hopfield-type, neural-network models. A mathematical framework for comparing the two models is developed, and the capacity of each model is investigated. The capacity of the SDM can be increased independent of the dimension of the stored vectors, whereas the Hopfield capacity is limited to a fraction of this dimension. The stored information is proportional to the number of connections, and it is shown that this proportionality constant is the same (...) for the SDM, the Hopfield model, and higher-order models. The models are also compared in their ability to store and recall temporal sequences of patterns. The SDM also includes time delays so that contextual information can be used to recover sequences. A generalization of the SDM allows storage of correlated patterns. (shrink)

In this paper I defend the propriety of explaining the behavior of distributed connectionist networks by appeal to selected data stored therein. In particular, I argue that if there is a problem with such explanations, it is a consequence of the fact that information storage in networks is superpositional, and not because it is distributed. I then develop a ``proto-account'''' of causation for networks, based on an account of Andy Clark''s, that shows even superpositionality does not undermine information-based explanation. Finally, (...) I argue that the resulting explanations are genuinely informative and not vacuous. (shrink)