This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 (...) The Psychological Reality of Programs: Strong Equivalence 5 Constraining Functional Architecture 6 The Bridge from Physical to Symbolic: Transduction 7 Functional Architecture and Analogue Processes 8 Mental Imagery and Functional Architecture 9 Epilogue: What is Cognitive Science the Science of? (shrink)

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. (shrink)

Proposals for quantum computation rely on superposed states implementing multiple computations simultaneously, in parallel, according to quantum linear superposition (e.g., Benioff, 1982; Feynman, 1986; Deutsch, 1985, Deutsch and Josza, 1992). In principle, quantum computation is capable of specific applications beyond the reach of classical computing (e.g., Shor, 1994). A number of technological systems aimed at realizing these proposals have been suggested and are being evaluated as possible substrates for quantum computers (e.g. trapped ions, electron spins, quantum dots, nuclear (...) spins, etc., see Table 1; Bennett, 1995; and Barenco, 1995). The main obstacle to realization of quantum computation is the problem of interfacing to the system (input, output) while also protecting the quantum state from environmental decoherence. If this problem can be overcome, then present day classical computers may evolve to quantum computers. (shrink)

Computation is central to the foundations of modern cognitive science, but its role is controversial. Questions about computation abound: What is it for a physical system to implement a computation? Is computation sufficient for thought? What is the role of computation in a theory of cognition? What is the relation between different sorts of computational theory, such as connectionism and symbolic computation? In this paper I develop a systematic framework that addresses all of these (...) questions. Justifying the role of computation requires analysis of implementation, the nexus between abstract computations and concrete physical systems. I give such an analysis, based on the idea that a system implements a computation if the causal structure of the system mirrors the formal structure of the computation. This account can be used to justify the central commitments of artificial intelligence and computational cognitive science: the thesis of computational sufficiency, which holds that the right kind of computational structure suffices for the possession of a mind, and the thesis of computational explanation, which holds that computation provides a general framework for the explanation of cognitive processes. The theses are consequences of the facts that computation can specify general patterns of causal organization, and mentality is an organizational invariant, rooted in such patterns. Along the way I answer various challenges to the computationalist position, such as those put forward by Searle. I close by advocating a kind of minimal computationalism, compatible with a very wide variety of empirical approaches to the mind. This allows computation to serve as a true foundation for cognitive science. (shrink)

Relative to digital computation, analogue computation has been neglected in the philosophical literature. To the extent that attention has been paid to analogue computation, it has been misunderstood. The received view—that analogue computation has to do essentially with continuity—is simply wrong, as shown by careful attention to historical examples of discontinuous, discrete analogue computers. Instead of the received view, I develop an account of analogue computation in terms of a particular type of analogue representation that (...) allows for discontinuity. This account thus characterizes all types of analogue computation, whether continuous or discrete. Furthermore, the structure of this account can be generalized to other types of computation: analogue computation essentially involves analogue representation, whereas digital computation essentially involves digital representation. Besides being a necessary component of a complete philosophical understanding of computation in general, understanding analogue computation is important for computational explanation in contemporary neuroscience and cognitive science. (shrink)

Computation and information processing are among the most fundamental notions in cognitive science. They are also among the most imprecisely discussed. Many cognitive scientists take it for granted that cognition involves computation, information processing, or both – although others disagree vehemently. Yet different cognitive scientists use ‘computation’ and ‘information processing’ to mean different things, sometimes without realizing that they do. In addition, computation and information processing are surrounded by several myths; first and foremost, that they are (...) the same thing. In this paper, we address this unsatisfactory state of affairs by presenting a general and theory-neutral account of computation and information processing. We also apply our framework by analyzing the relations between computation and information processing on one hand and classicism and connectionism on the other. We defend the relevance to cognitive science of both computation, in a generic sense that we fully articulate for the first time, and information processing, in three important senses of the term. Our account advances some foundational debates in cognitive science by untangling some of their conceptual knots in a theory-neutral way. By leveling the playing field, we pave the way for the future resolution of the debates’ empirical aspects. (shrink)

Do the dynamics of a physical system determine what function the system computes? Except in special cases, the answer is no: it is often indeterminate what function a given physical system computes. Accordingly, care should be taken when the question ‘What does a particular neuronal system do?’ is answered by hypothesising that the system computes a particular function. The phenomenon of the indeterminacy of computation has important implications for the development of computational explanations of biological systems. Additionally, the phenomenon (...) lends some support to the idea that a single neuronal structure may perform multiple cognitive functions, each subserved by a different computation. We provide an overarching conceptual framework in order to further the philosophical debate on the nature of computational indeterminacy and computational explanation. (shrink)

One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...) Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the Ω-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. Second, we show that the sets in a universal Martin-Lof test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Lof test. (shrink)

This book, a joint publication of the Institute of Physics Publishing and Oxford University Press, is the third in a series of three works that form part of the Oxford/IOP Computational Intelligence Library project. The other two works are the Handbook of Neural Computation and the Handbook of Evolutionary Computation. Each of the three handbooks is available in loose-leaf print form, as well as in an electronic version that combines both CD-ROM and on-line (World Wide Web) access to (...) the contents. In each case, regularly published supplements will be available on a subscription basis. (shrink)

Functional versus Subjective Consciousness The Example of Pain Dieting and Free Will The Production/Judgement Model Judgement is not Reward Feelings are Judgements Low-Bandwidth Channels Candidate Neural Control Channels Timing of Intention and Action Conclusion References Abstract.

This Element has three main aims. First, it aims to help the reader understand the concept of computation that Turing developed, his corresponding results, and what those results indicate about the limits of computational possibility. Second, it aims to bring the reader up to speed on analyses of computation in physical systems which provide the most general characterizations of what it takes for a physical system to be a computational system. Third, it aims to introduce the reader to (...) some different kinds of quantum computers, describe quantum speedup, and present some explanation sketches of quantum speedup. If successful, this Element will equip the reader with a basic knowledge necessary for pursuing these topics in more detail. (shrink)

An influential view in cognitive science is that computation in cognitive systems is semantic, conceptually depending on representation: to compute is to manipulate representations. I argue that accepting the non-semantic teleomechanistic view of computation lays the ground for a promising alternative strategy, in which computation helps to explain and naturalise representation, rather than the other way around. I show that this computation-based approach to representation presents six decisive advantages over the semantic view. I claim that it (...) can improve the two most influential current theories of representation, teleosemantics and structural representation, by providing them with precious tools to tackle some of their main shortcomings. In addition, the computation-based approach opens up interesting new theoretical paths for the project of naturalising representation, in which teleology plays a role in individuating computations, but not representations. (shrink)

states are to be understood in terms of their functional relationships to other mental states, not in terms of their material instantiation in any particular kind of hardware. But the argument that material instantiation is irrelevant to functional..

This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed (...) for the potential information of the world to actualize. Starting from the definition of information as the difference in one physical system that makes a difference in another physical system – which combines Bateson and Hewitt’s definitions, the argument is advanced for natural computation as a computational model of the dynamics of the physical world, where information processing is constantly going on, on a variety of levels of organization. This setting helps us to elucidate the relationships between computation, information, agency and cognition, within the common conceptual framework, with special relevance for biology and robotics. (shrink)

Topological indices are of incredible significance in the field of graph theory. Convex polytopes play a significant role both in various branches of mathematics and also in applied areas, most notably in linear programming. We have calculated some topological indices such as atom-bond connectivity index, geometric arithmetic index, K-Banhatti indices, and K-hyper-Banhatti indices and modified K-Banhatti indices from some families of convex polytopes through M-polynomials. The M-polynomials of the graphs provide us with a great help to calculate the topological indices (...) of different structures. (shrink)

We consider processes of emergence within the conceptual framework of the Information Loss principle and the concepts of systems conserving information; systems compressing information; and systems amplifying information. We deal with the supposed incompatibility between emergence and computability tout-court. We distinguish between computational emergence, when computation acquires properties, and emergent computation, when computation emerges as a property. The focus is on emergence processes occurring within computational processes. Violations of Turing-computability such as non-explicitness and incompleteness are intended to (...) represent partially the properties of phenomenological emergence, such as logical openness, given by the observer’s cognitive role; structural dynamics where change regards rules rather than only values; and multi-modelling where multiple non-equivalent models are required to model such structural dynamics. In this way, we validate, from an epistemological viewpoint, models and simulations of phenomenological emergence where the sequence of events constitutes the natural, analogical non-Turing computation which a cognitive complex system can reproduce through learning. Reproducibility through learning is different from Turing-like computational iteration. This paper aims to open a new, non-reductionist understanding of the conceptual relationship between emergence and computability. (shrink)

Although one can endorse the complexity of the data and processes that Phillips & Singer (P&S) review, their mathematical suggestions can be compared critically with cases in nonlinear psychophysics, where the theoretician is faced with analogous problems. Owing to P&S's failure adequately to recognise both the intricate properties of nonlinear dynamics in networks and the constraints of metabolic demands on the temporal generation of patterns in biological nets their conclusions fail to meet the problems they properly address.

This book explores the application of dynamical theory to cognitive science. Giunti shows how the dynamical approach can illuminate problems of cognition, information processing, consciousness, meaning, and the relation between body and mind.

In the paper I discuss the importance of relativistic hypercomputation for the philosophy of mathematics, in particular for our understanding of mathematical knowledge. I also discuss the problem of the explanatory role of mathematics in physics and argue that relativistic computation fits very well into the so-called programming account. Relativistic computation reveals an interesting interplay between the empirical realm and the realm of very abstract mathematical principles that even exceed standard mathematics and suggests, that such principles might play (...) an explanatory role. I also argue that relativistic computation does not have some of the weaknesses of other hypercomputational models, thus it is particularly attractive for the philosophy of mathematics. (shrink)

What does it mean to say that an object or system computes? What is it about laptops, smartphones, and nervous systems that they are considered to compute, and why does it seldom occur to us to describe stomachs, hurricanes, rocks, or chairs that way? Though computing systems are everywhere today, it is very difficult to answer these questions. The book aims to shed light on the subject by arguing for the semantic view of computation, which states that computingsystems are (...) always accompanied by representations. This view is presented as an alternative to non-semantic views such as the mechanistic account of computation. (shrink)

Although computation and the science of physical systems would appear to be unrelated, there are a number of ways in which computational and physical concepts can be brought together in ways that illuminate both. This volume examines fundamental questions which connect scholars from both disciplines: is the universe a computer? Can a universal computing machine simulate every physical process? What is the source of the computational power of quantum computers? Are computational approaches to solving physical problems and paradoxes always (...) fruitful? Contributors from multiple perspectives reflecting the diversity of thought regarding these interconnections address many of the most important developments and debates within this exciting area of research. Both a reference to the state of the art and a valuable and accessible entry to interdisciplinary work, the volume will interest researchers and students working in physics, computer science, and philosophy of science and mathematics. (shrink)

A basic deep neural network (DNN) is trained to exhibit a large set of input–output dispositions. While being a good model of the way humans perform some tasks automatically, without deliberative reasoning, more is needed to approach human‐like artificial intelligence. Analysing recent additions brings to light a distinction between two fundamentally different styles of computation: content‐specific and non‐content‐specific computation (as first defined here). For example, deep episodic RL networks draw on both. So does human conceptual reasoning. Combining the (...) two takes advantage of the complementary costs and benefits of each. It also offers a better model of human cognitive competence. (shrink)

The book presents investigations into the world of info-computational nature, in which information constitutes the structure, while computational process amounts to its change. Information and computation are inextricably bound: There is no computation without informational structure, and there is no information without computational process. Those two complementary ideas are used to build a conceptual net, which according to Novalis is a theoretical way of capturing reality. We apprehend the reality within a framework known as natural computationalism, the view (...) that the whole universe can be understood as a computational system at many different levels - from quantum mechanical world, to biological organisms including intelligent minds and their societies. Questions about nature of information and computation and their unified view are addressed along with application of info- computational approach to knowledge generation. (shrink)

Dynamics is not enough for cognition, nor it is a substitute for information-processing aspects of brain behavior. Moreover, dynamics and computation are not at odds, but are quite compatible. They can be synthesized so that any dynamical system can be analyzed in terms of its intrinsic computational components.

The Church-Turing Thesis is widely regarded as true, because of evidence that there is only one genuine notion of computation. By contrast, there are nowadays many different formal logics, and different corresponding foundational frameworks. Which ones can deliver a theory of computability? This question sets up a difficult challenge: the meanings of basic mathematical terms are not stable across frameworks. While it is easy to compare what different frameworks say, it is not so easy to compare what they mean. (...) We argue for some minimal conditions that must be met if two frameworks are to be compared; if frameworks are radical enough, comparison becomes hopeless. Our aim is to clarify the dialectical situation in this bourgeoning area of research, shedding light on the nature of non-classical logic and the notion of computation alike. (shrink)

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state (...) of the art in the area. (shrink)

Computation and Metacognitive skills are essential sub-skills under the domain of Critical Thinking which is a 21 st Century Skill. Having acquired these skills can greatly help students to have a better performance in the Mathematics course. The purpose of this study was to determine whether computation and metacognitive skills are significant predictors of students' performance in Mathematics. Students from four sections of the course Mathematics in the Modern World which was offered during the first semester of the (...) academic year 2018-2019 were selected as the participants of this study which was conducted at Gov. Alfonso D. Tan College, Tangub City, Misamis Occidental, Philippines. The results of this study showed that students' scores in computation and metacognitive test of skills significantly correlate with the students' performance in Mathematics in terms of Grade Point Average (GPA) and a positive direct relationship has been established. Using the Regression Analysis, the result revealed that both computation and metacognitive skills of the students were significant predictors of their performance in Mathematics. These research outcomes affirm that if students acquire these skills, they tend to perform better in Mathematics. This suggests that teachers are encouraged to be more strategic in training the students to acquire and develop computation and metacognitive skills by administering various mathematical problems that encourage students to think critically. (shrink)

In Transparent Intensional Logic we can recognize two distinct notions of computation that loosely correspond to term rewriting and term interpretation as known from lambda calculus. Our goal will be to further explore these two notions and examine some of their properties.

This Ph.D. thesis explores a novel way of thinking about computation in cognitive science. It argues for what I call ‘the mechanistic account of wide computationalism’, or simply wide mechanistic computation. The key claim is that some cognitive and perceptual abilities are produced by or are the result of computational mechanisms that are, in part, located outside the individual; that computational systems, the ones that form the proper units of analysis in cognitive science, are particular types of functional (...) mechanisms that, on occasion, spread out across brain, body, and world. Wide mechanistic computation is the result of bringing together two distinct strands of thinking about computation: ‘wide’ views, which hold that computational systems can, on occasion, include parts of the surrounding environment; and ‘mechanistic’ views, which hold that computational explanation is a species of mechanistic explanation, and that computational mechanisms are a special type of functional mechanism. I argue that wide mechanistic computation draws support from several sources. First, I examine research on animal and human psychology and show that several organisms’ behaviours are properly treated as being the output of wide computational mechanisms. Second, I defend the view from several philosophical charges, including worries about its explanatory parsimony and empirical testability. Finally, I argue for the view’s theoretical credentials by showing that it can help resolve specific problems that have recently troubled 4E cognition. The result is an argument for not only the coherence but also empirical plausibility of wide mechanistic computation. On route to its main objective, the thesis also accomplishes a number of related tasks, including: providing a framework for organising and conceptualising different views of computation, securing the conceptual foundations of mechanistic computation by addressing an outstanding challenge called the ‘abstraction problem’, sounding a cautionary note about recent predictive processing accounts of extended cognition and arguing against a particular conception of levels often used within cognitive science, what is labelled the ‘hierarchical correspondence view of levels’. (shrink)