The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including (...) their energy efficiency, cost, reliability, and durability. Second, I critically analyze the notion of “offloading” computation to the morphology of an agent or robot, by showing that, literally, computation is sometimes not offloaded but simply avoided. Third, I point out that while the morphology of any agent is indicative of the environment that it is adapted to, or informative about that environment, it does not follow that every agent has access to its morphology as the model of its environment. (shrink)

Physical Computation is the summation of Piccinini’s work on computation and mechanistic explanation over the past decade. It draws together material from papers published during that time, but also provides additional clarifications and restructuring that make this the definitive presentation of his mechanistic account of physical computation. This review will first give a brief summary of the account that Piccinini defends, followed by a chapter-by-chapter overview of the book, before finally discussing one aspect of the (...) account in more critical detail. (shrink)

The relationship between abstract formal procedures and the activities of actual physical systems has proved to be surprisingly subtle and controversial, and there are a number of competing accounts of when a physical system can be properly said to implement a mathematical formalism and hence perform a computation. I defend an account wherein computational descriptions of physical systems are high-level normative interpretations motivated by our pragmatic concerns. Furthermore, the criteria of utility and success vary according to (...) our diverse purposes and pragmatic goals. Hence there is no independent or uniform fact to the matter, and I advance the ‘anti-realist’ conclusion that computational descriptions of physical systems are not founded upon deep ontological distinctions, but rather upon interest-relative human conventions. Hence physical computation is a ‘conventional’ rather than a ‘natural’ kind. (shrink)

This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas (...) in terms of low-level fundamental concepts in statistical mechanics, thus providing a deeper understanding of these ideas than their standard formulations given in the high-level terms of thermodynamics and cognitive science. Since Landauer’s principle is pivotal in the attempts to derive the universal validity of the second law of thermodynamics in statistical mechanics, our result entails that the multiple-computations theorem has crucial implications with respect to the second law. Finally, our analysis contributes to the understanding of notions, such as “logical irreversibility,” “entropy increase,” “implementing a computation,” in terms of fundamental physics, and to resolving open questions in the literature of both fields, such as: what could it possibly mean that a certain physical process implements a certain computation. (shrink)

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line why Putnam’s result, and likewise the more restricted result we call the Multiple- Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why (...) nonreductive approaches to solving the multiple- computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam’s unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. (shrink)

The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from (...) an incomputable information source in accordance with Bell’s constraints. On condition that we give up the formal concept of “universality”, the possibility to realize quantum oracles is reachable. In this way computation is led back to the logic of physical world. (shrink)

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a (...) path between the two horns of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (shrink)

In this paper, I show how semantic factors constrain the understanding of the computational phenomena to be explained so that they help build better mechanistic models. In particular, understanding what cognitive systems may refer to is important in building better models of cognitive processes. For that purpose, a recent study of some phenomena in rats that are capable of ‘entertaining’ future paths (Pfeiffer and Foster 2013) is analyzed. The case shows that the mechanistic account of physical computation may (...) be complemented with semantic considerations, and in many cases, it actually should. (shrink)

Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, (...) mostly with reference to the debate over realism about physical computation and computationalism. A welcome exception is Dewhurst’s ([2018]) recent analysis of computational individuation under the mechanistic framework. He rejects the idea of appealing to semantic properties for determining the computational identity of a physical system. But Dewhurst seems to be too quick to pay the price of giving up the notion of computational equivalence. We aim to show that the mechanist need not pay this price. The mechanistic framework can, in principle, preserve the idea of computational equivalence even between two different enough kinds of physical systems, say, electrical and hydraulic ones. (shrink)

In this paper, I argue that computationalism is a progressive research tradition. Its metaphysical assumptions are that nervous systems are computational, and that information processing is necessary for cognition to occur. First, the primary reasons why information processing should explain cognition are reviewed. Then I argue that early formulations of these reasons are outdated. However, by relying on the mechanistic account of physical computation, they can be recast in a compelling way. Next, I contrast two computational models of (...) working memory to show how modeling has progressed over the years. The methodological assumptions of new modeling work are best understood in the mechanistic framework, which is evidenced by the way in which models are empirically validated. Moreover, the methodological and theoretical progress in computational neuroscience vindicates the new mechanistic approach to explanation, which, at the same time, justifies the best practices of computational modeling. Overall, computational modeling is deservedly successful in cognitive science. Its successes are related to deep conceptual connections between cognition and computation. Computationalism is not only here to stay, it becomes stronger every year. (shrink)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content (...) is extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition (...) and not the other way around. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming (...) to formalise algorithmic computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

In this article, after presenting the basic idea of causal accounts of implementation and the problems they are supposed to solve, I sketch the model of computation preferred by Chalmers and argue that it is too limited to do full justice to computational theories in cognitive science. I also argue that it does not suffice to replace Chalmers’ favorite model with a better abstract model of computation; it is necessary to acknowledge the causal structure of physical computers (...) that is not accommodated by the models used in computability theory. Additionally, an alternative mechanistic proposal is outlined. (shrink)

Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and for this reason, (...) difficult to pin down exactly. I claim that MR is of little importance for defending computationalism, and argue that it should rather appeal to organizational invariance or substrate neutrality of computation, which are much more intuitive but cannot support strong antireductionist arguments. (shrink)

In this paper, the issues of computability and constructivity in the mathematics of physics are discussed. The sorts of questions to be addressed are those which might be expressed, roughly, as: Are the mathematical foundations of our current theories unavoidably non-constructive: or, Are the laws of physics computable?

Organisations are computing systems. The university’s sports centre is a computing system for managing sports teams and facilities. The tenure committee is a computing system for assigning tenure status. Despite an increasing number of publications in group ontology, the computational nature of organisations has not been recognised. The present paper is the first in this debate to propose a theory of organisations as groups structured for computing. I begin by describing the current situation in group ontology and by spelling out (...) the thesis in more detail. I then present the example of a sports centre to illustrate why one might intuitively think of organisations as computing systems. To substantiate the thesis, I introduce Piccinini’s restrictive analysis of physical computation. As I show, organisations meet all criteria for being computing systems. Organisations are structured groups with the function of manipulating medium-independent vehicles according to rules. Furthermore, I argue for the modal claim that this is a necessary feature of organisations. Having sketched the computational account of organisations, I compare it to other proposals in the literature. (shrink)

In recent years, there are a number of proposals to consider collision-based soliton computer based on certain chemical reactions, namely Belousov-Zhabotinsky reaction, which leads to soliton solutions of coupled Nonlinear Schroedinger equations. They are called Manakov System. But it seems to us that such a soliton computer model can also be based on solitary wave solution of Maxwell-Dirac equation, which reduces to Choquard equation. And soliton solution of Choquard equation has been investigated by many researchers, therefore it seems more profound (...) from physics perspective. However, we consider both schemes of soliton computer are equally possible. More researches are needed to verify our proposition. (shrink)

This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have (...) the potential to do more than calculators, which are computers that are designed not to learn. Today’s computers are not designed to learn; rather, they are designed to support learning; therefore, any theory of content tested by computers that currently exist must be of an empirical, rather than a formal nature. If they are designed someday to learn, we will see a change in roles, requiring an empirical theory about the Turing architecture’s content, using the primitives of learning machines. This way of thinking, which I call the intensional view of computers, avoids the problems of analogies between minds and computers. It focuses on the constitutive properties of computers, such as showing clearly how they can help us avoid the infinite regress in interpretation, and how we can clarify the terms of the suggested mechanisms to facilitate a useful debate. Within the intensional view, syntax and content in the context of computers become two ends of physically realizing correspondence problems in various domains. (shrink)

Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical (...) processes represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformation. (shrink)

Since the sixties, computational modeling has become increasingly important in both the physical and the social sciences, particularly in physics, theoretical biology, sociology, and economics. Sine the eighties, philosophers too have begun to apply computational modeling to questions in logic, epistemology, philosophy of science, philosophy of mind, philosophy of language, philosophy of biology, ethics, and social and political philosophy. This chapter analyzes a selection of interesting examples in some of those areas.

In most accounts of realization of computational processes by physical mechanisms, it is presupposed that there is one-to-one correspondence between the causally active states of the physical process and the states of the computation. Yet such proposals either stipulate that only one model of computation is implemented, or they do not reflect upon the variety of models that could be implemented physically. In this paper, I claim that mechanistic accounts of computation should allow for a (...) broad variation of models of computation. In particular, some non-standard models should not be excluded a priori. The relationship between mathematical models of computation and mechanistically adequate models is studied in more detail. (shrink)

Cognitive representations are typically analysed in terms of content, vehicle and format. While current work on formats appeals to intuitions about external representations, such as words and maps, in this paper we develop a computational view of formats that does not rely on intuitions. In our view, formats are individuated by the computational profiles of vehicles, i.e., the set of constraints that fix the computational transformations vehicles can undergo. The resulting picture is strongly pluralistic, it makes space for a variety (...) of different formats, and is intimately tied to the computational approach to cognition in cognitive science and artificial intelligence. (shrink)

This review essay analyzes the book by Giuseppe Primiero, On the foundations of computing. Oxford: Oxford University Press (ISBN 978-0-19-883564-6/hbk; 978-0-19-883565-3/pbk). xix, 296 p. (2020). It gives a critical view from the perspective of physical computing as a foundation of computing and argues that the neglected pillar of material computation (Stepney) should be brought centerstage and computing recognized as the fourth great domain of science (Denning).

Very plausibly, nothing can be a genuine computing system unless it meets an input-sensitivity requirement. Otherwise all sorts of objects, such as rocks or pails of water, can count as performing computations, even such as might suffice for mentality—thus threatening computationalism about the mind with panpsychism. Maudlin in J Philos 86:407–432, ( 1989 ) and Bishop ( 2002a , b ) have argued, however, that such a requirement creates difficulties for computationalism about conscious experience, putting it in conflict with the (...) very intuitive thesis that conscious experience supervenes on physical activity. Klein in Synthese 165:141–153, ( 2008 ) proposes a way for computationalists about experience to avoid panpsychism while still respecting the supervenience of experience on activity. I argue that his attempt to save computational theories of experience from Maudlin’s and Bishop’s critique fails. (shrink)

Most physics theories are deterministic, with the notable exception of quantum mechanics which, however, comes plagued by the so-called measurement problem. This state of affairs might well be due to the inability of standard mathematics to “speak” of indeterminism, its inability to present us a worldview in which new information is created as time passes. In such a case, scientific determinism would only be an illusion due to the timeless mathematical language scientists use. To investigate this possibility it is necessary (...) to develop an alternative mathematical language that is both powerful enough to allow scientists to compute predictions and compatible with indeterminism and the passage of time. We suggest that intuitionistic mathematics provides such a language and we illustrate it in simple terms. (shrink)

A physical model was utilized to show that the neural system can memorize a target position and is able to cause motor and sensory events that move the arm to a target with more accuracy. However, this cannot indicate in which coordinates the necessary computations are carried out. Turning off the lights causes the error to increase which is accomplished by cutting off one feedback path. The geometrical properties of arm kinematics and the properties of the kinesthetic and visual (...) sensorial systems should be better known before inferences about higher levels of processing can be drawn. (shrink)

The central motivating idea behind the development of this work is the concept of prespace, a hypothetical structure that is postulated by some physicists to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the rest of reality as we know it, and the implications of the existence of this structure for quantum theory. Understanding how this structure could relate to space and to the rest of reality requires, I (...) believe, that we consider how space itself relates to reality, and how other so-called "spaces" used in physics relate to reality. In chapter 2, I compare space and space-time to other spaces used in physics, such as configuration space, phase space and Hilbert space. I support what is known as the "property view" of space, opposing both the traditional views of space and space-time, substantivalism and relationism. I argue that all these spaces are property spaces. After examining the relationships of these spaces to causality, I argue that configuration space has, due to its role in quantum mechanics, a special status in the microscopic world similar to the status of position space in the macroscopic world. In chapter 3, prespace itself is considered. One way of approaching this structure is through the comparison of the prespace structure with a computational system, in particular to a cellular automaton, in which space or space-time and all other physical quantities are broken down into discrete units. I suggest that one way open for a prespace metaphysics can be found if physics is made fully discrete in this way. I suggest as a heuristic principle that the physical laws of our world are such that the computational cost of implementing those laws on an arbitrary computational system is minimized, adapting a heuristic principle of this type proposed by Feynman. In chapter 4, some of the ideas of the previous chapters are applied in an examination of the physics and metaphysics of quantum theory. I first discuss the "measurement problem" of quantum mechanics: this problem and its proposed solution are the primary subjects of chapter 4. It turns out that considering how quantum theory could be made fully discrete leads naturally to a suggestion of how standard linear quantum mechanics could be modified to give rise to a solution to the measurement problem. The computational heuristic principle reinforces the same solution. I call the modified quantum mechanics Critical Complexity Quantum Mechanics (CCQM). I compare CCQM with some of the other proposed solutions to the measurement problem, in particular the spontaneous localization model of Ghirardi, Rimini and Weber. Finally, in chapters 5 and 6, I argue that the measure of complexity of quantum mechanical states I introduce in CCQM also provides a new definition of entropy for quantum mechanics, and suggests a solution to the problem of providing an objective foundation for statistical mechanics, thermodynamics, and the arrow of time. (shrink)

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)

This essay presents arguments for the claim that in the best of all possible worlds (Leibniz) there are sources of unpredictability and creativity for us humans, even given a pancomputational stance. A suggested answer to Chaitin’s questions: “Where do new mathematical and biological ideas come from? How do they emerge?” is that they come from the world and emerge from basic physical (computational) laws. For humans as a tiny subset of the universe, a part of the new ideas comes (...) as the result of the re-configuration and reshaping of already existing elements and another part comes from the outside as a consequence of openness and interactivity of the system. For the universe at large it is randomness that is the source of unpredictability on the fundamental level. In order to be able to completely predict the Universe-computer we would need the Universe-computer itself to compute its next state; as Chaitin already demonstrated there are incompressible truths which means truths that cannot be computed by any other computer but the universe itself. (shrink)

A number of examples have been given of physical systems (both classical and quantum mechanical) which when provided with a (continuously variable) computable input will give a non-computable output. It has been suggested that these systems might allow one to design analogue machines which would calculate the values of some number-theoretic non-computable function. Analysis of the examples show that the suggestion is wrong. In Section 4 I claim that given a reasonable definition of analogue machine it will always be (...) wrong. The claim is to be read not so much as a dogmatic assertion, but rather as a challenge. -/- In Sections 1 and 2 I discuss analogue machines, and lay down some conditions which I believe they must satisfy. In Section I discuss the particular forms which a paradigm undecidable problem (or non-computable function) may take. In Sections 5 and 6 I justify any claim for two particular examples lying within the range of classical physics, and in Section 7 I justify it for two (closely connected) examples from quantum mechanics, and discuss, very briefly, other possible quantum mechanical situations. Section 8 contains various remarks and comments. In Section 9 I consider the suggestion made by Penrose that a (future) theory of quantum gravity may predict non-locally-determined, and perhaps non-computable patterns of growth for microsopic structures. My conclusion is that such a theory will have to have non-computability built into it. (shrink)

Analysis is given of the Omega Point cosmology, an extensively peer-reviewed proof (i.e., mathematical theorem) published in leading physics journals by professor of physics and mathematics Frank J. Tipler, which demonstrates that in order for the known laws of physics to be mutually consistent, the universe must diverge to infinite computational power as it collapses into a final cosmological singularity, termed the Omega Point. The theorem is an intrinsic component of the Feynman-DeWitt-Weinberg quantum gravity/Standard Model Theory of Everything (TOE) describing (...) and unifying all the forces in physics, of which itself is also required by the known physical laws. With infinite computational resources, the dead can be resurrected--never to die again--via perfect computer emulation of the multiverse from its start at the Big Bang. Miracles are also physically allowed via electroweak quantum tunneling controlled by the Omega Point cosmological singularity. The Omega Point is a different aspect of the Big Bang cosmological singularity--the first cause--and the Omega Point has all the haecceities claimed for God in the traditional religions. -/- From this analysis, conclusions are drawn regarding the social, ethical, economic and political implications of the Omega Point cosmology. (shrink)

We present a simple example that disproves the universality principle. Unlike previous counter-examples to computational universality, it does not rely on extraneous phenomena, such as the availability of input variables that are time varying, computational complexity that changes with time or order of execution, physical variables that interact with each other, uncertain deadlines, or mathematical conditions among the variables that must be obeyed throughout the computation. In the most basic case of the new example, all that is used (...) is a single pre-existing global variable whose value is modified by the computation itself. In addition, our example offers a new dimension for separating the computable from the uncomputable, while illustrating the power of parallelism in computation. (shrink)

The journal of Cognitive Computation is defined in part by the notion that biologically inspired computational accounts are at the heart of cognitive processes in both natural and artificial systems. Many studies of various important aspects of cognition (memory, observational learning, decision making, reward prediction learning, attention control, etc.) have been made by modelling the various experimental results using ever-more sophisticated computer programs. In this manner progressive inroads have been made into gaining a better understanding of the many components (...) of cognition. Concomitantly in both science and science fiction the hope is periodically re-ignited that a manmade system can be engineered to be fully cognitive and conscious purely in virtue of its execution of an appropriate computer program. However, whilst the usefulness of the computational metaphor in many areas of psychology and neuroscience is clear, it has not gone unchallenged and in this article I will review a group of philosophical arguments that suggest either such unequivocal optimism in computationalism is misplaced—computation is neither necessary nor sufficient for cognition—or panpsychism (the belief that the physical universe is fundamentally composed of elements each of which is conscious) is true. I conclude by highlighting an alternative metaphor for cognitive processes based on communication and interaction. (shrink)

In the domain of cognitive science, understanding consciousness through the investigation of neural correlates has been the primary research approach. The exploration of neural correlates of consciousness is focused on identifying these correlates and reducing consciousness to a physical phenomenon, embodying a form of reductionist physicalism. This inevitably leads to challenges in explaining consciousness itself. The computational interpretation of consciousness takes a functionalist view, grounded in physicalism, and models conscious experience as a cognitive function, elucidated through computational means. This (...) paper posits that predictive processing offers a fresh paradigm for comprehending human cognition and serves as a neural foundation for the computational elucidation of consciousness. Additionally, free energy theory, as a mathematical construct explaining the predictive processing model, furnishes a theoretical scaffold for understanding consciousness computationally. (shrink)

The scope of Platonism is extended by introducing the concept of a “Platonic computer” which is incorporated in metacomputics. The theoretical framework of metacomputics postulates that a Platonic computer exists in the realm of Forms and is made by, of, with, and from metaconsciousness. Metaconsciousness is defined as the “power to conceive, to perceive, and to be self-aware” and is the formless, con-tentless infinite potentiality. Metacomputics models how metaconsciousness generates the perceived actualities including abstract entities and physical and nonphysical (...) realities. It is postulated that this is achieved via digital computation using the Platonic computer. The introduction of a Platonic computer into the realm of Forms thus bridges the “inverse explanatory gap” and therefore solves the “inverse hard problem of consciousness” in the philosophy of mind. (shrink)

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

In this paper, building on these previous works, we propose to go deeper into the understanding of crowd behavior by proposing an approach which integrates ontologi- cal models of crowd behavior and dedicated computer vision algorithms, with the aim of recognizing some targeted complex events happening in the playground from the observation of the spectator crowd behavior. In order to do that, we first propose an ontology encoding available knowledge on spectator crowd behavior, built as a spe- cialization of the (...) DOLCE foundational ontology, which allows the representation of categories belonging both to the physical and to the social realms. We then propose a simplified and tractable version of such ontology in a new temporal extension of a description logic, which is used for temporally coupling events happening on the play- ground and spectator crowd behavior. At last, computer vision algorithms provide the input information concerning what is observed on the stands and ontological reasoning delivers the output necessary to perform complex event recognition. (shrink)

The electric activities of cortical pyramidal neurons are supported by structurally stable, morphologically complex axo-dendritic trees. Anatomical differences between axons and dendrites in regard to their length or caliber reflect the underlying functional specializations, for input or output of neural information, respectively. For a proper assessment of the computational capacity of pyramidal neurons, we have analyzed an extensive dataset of three-dimensional digital reconstructions from the NeuroMorphoOrg database, and quantified basic dendritic or axonal morphometric measures in different regions and layers of (...) the mouse, rat or human cerebral cortex. Physical estimates of the total number and type of ions involved in neuronal electric spiking based on the obtained morphometric data, combined with energetics of neurotransmitter release and signaling fueled by glucose consumed by the active brain, support highly efficient cerebral computation performed at the thermodynamically allowed Landauer limit for implementation of irreversible logical operations. Individual proton tunneling events in voltage-sensing S4 protein alpha-helices of Na+, K+ or Ca2+ ion channels are ideally suited to serve as single Landauer elementary logical operations that are then amplified by selective ionic currents traversing the open channel pores. This miniaturization of computational gating allows the execution of over 1.2 zetta logical operations per second in the human cerebral cortex without combusting the brain by the released heat. (shrink)

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that (...) the Effective version of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

The explosive growth in computational power over the past several decades offers new tools and opportunities for economists. This handbook volume surveys recent research on Agent-based Computational Economics (ACE), the computational study of economic processes modeled as open-ended dynamic systems of interacting agents. Empirical referents for “agents” in ACE models can range from individuals or social groups with learning capabilities to physical world features with no cognitive function. Topics covered include: learning; empirical validation; network economics; social dynamics; financial markets; (...) innovation and technological change; organizations; market design; automated markets and trading agents; political economy; social-ecological systems; computational laboratory development; and general methodological issues. (shrink)

Three special issues of Entropy journal have been dedicated to the topics of “InformationProcessing and Embodied, Embedded, Enactive Cognition”. They addressed morphological computing, cognitive agency, and the evolution of cognition. The contributions show the diversity of views present in the research community on the topic of computation and its relation to cognition. This paper is an attempt to elucidate current debates on computation that are central to cognitive science. It is written in the form of a dialog between (...) two authors representing two opposed positions regarding the issue of what computation is and could be, and how it can be related to cognition. Given the different backgrounds of the two researchers, which span physics, philosophy of computing and information, cognitive science, and philosophy, we found the discussions in the form of Socratic dialogue appropriate for this multidisciplinary/cross-disciplinary conceptual analysis. We proceed as follows. First, the proponent (GDC) introduces the info-computational framework as a naturalistic model of embodied, embedded, and enacted cognition. Next, objections are raised by the critic (MM) from the point of view of the new mechanistic approach to explanation. Subsequently, the proponent and the critic provide their replies. The conclusion is that there is a fundamental role for computation, understood as information processing, in the understanding of embodied cognition. (shrink)

Computational Functionalism is a subfield of philosophy of mind most relevant to the subject of cognitive science as well as to artificial intelligence (AI). The analysis of this paper focuses on Hilary Putnam’s and Gualtiero Piccinini’s standpoints regarding the molecular understanding of computation. Finally, Putnam’s argument of the functionalism in notion of the mental states is based on the positive definition of those states by their functions, while Piccinini, and on the other hand suggest that an understanding of the (...) mechanism of computation will go a long way to explaining cognition. This research also points out shortcomings of functionalism in their theories especially in regards to connectivity with physicality of AI structures. Therefore, the paper identifies the following gaps: The first gap holds that although both theorists have important insights, the two approaches put forward by the respective theorists are flawed and a better proposal is required, then a new proposal is suggested In identifying these gaps, the paper seeks to contribute to the literature by arguing for the need to develop a composite of the two theorists. The results show that the big ideas are important in present-day AI debate and analysis, which helps to explain the mind as computation. (shrink)

In this paper, the role of the environment and physical embodiment of computational systems for explanatory purposes will be analyzed. In particular, the focus will be on cognitive computational systems, understood in terms of mechanisms that manipulate semantic information. It will be argued that the role of the environment has long been appreciated, in particular in the work of Herbert A. Simon, which has inspired the mechanistic view on explanation. From Simon’s perspective, the embodied view on cognition seems natural (...) but it is nowhere near as critical as its proponents suggest. The only point of difference between Simon and embodied cognition is the significance of body-based off-line cognition; however, it will be argued that it is notoriously over-appreciated in the current debate. The new mechanistic view on explanation suggests that even if it is critical to situate a mechanism in its environment and study its physical composition, or realization, it is also stressed that not all detail counts, and that some bodily features of cognitive systems should be left out from explanations. (shrink)

Architecture often relies on mathematical models, if only to anticipate the physical behavior of structures. Accordingly, mathematical modeling serves to find an optimal form given certain constraints, constraints themselves translated into a language which must be homogeneous to that of the model in order for resolution to be possible. Traditional modeling tied to design and architecture thus appears linked to a topdown vision of creation, of the modernist, voluntarist and uniformly normative type, because usually (mono)functionalist. One available instrument of (...) calculation/representation/prescription orders this conception of architecture: indeed the search for an optimal solution through mathematical calculation of a model itself mathematical, thus homogeneous and simple, is only possible when one or two functions or functional constraints are formulated, never more, and this, on a global level, therefore starting from a unique and homogenizing viewpoint. It is essential to grasp that, even applied to material and its properties or towards a particular esthetic or functional dimension, this viewpoint is thus abstractive and generalizing: disregarding singularity of context, insertion and relationship to the environment or local, social behavior. It leaves aside functional specificity and heterogeneousness – re-contextualized each time – of functions that the object or edifice are required to fulfill and optimize under diverse constraints, in their different parts. The computational turning point today’s digital design and computational architecture embody modifies these instrumental, original prescriptions, rendering them more flexible. Perhaps in light of this turnabout we should retrospectively interpret 20th century calls for modernism, functionalism and even biomorphism as being just as many ex post rationalizations in respect to techniques of strongly prescriptive modeling since our only instrument is a monolithic language, and so being, incites a top-down conception, (naturally weakly reactive to contexts), including forms whose overall appearance resembles in fine a living form. In order to liberate oneself from this and despite everything, emerge as its initiators, one has constructed from ideology and philosophy (of object, habitat, the urban) ex post, even while it is the instrument of modeling and conception that largely determines, normalizes and dictates ex ante, the possibilities and limitations of the creation of forms and living experiments4 in a given time. (shrink)

In this paper we will demonstrate that a computational system can meet the criteria for autonomy laid down by classical enactivism. The two criteria that we will focus on are operational closure and structural determinism, and we will show that both can be applied to a basic example of a physically instantiated Turing machine. We will also address the question of precariousness, and briefly suggest that a precarious Turing machine could be designed. Our aim in this paper is to challenge (...) the assumption that computational systems are necessarily heteronomous systems, to try and motivate in enactivism a more nuanced and less rigid conception of computational systems, and to demonstrate to computational theorists that they might find some interesting material within the enactivist tradition, despite its historical hostility towards computationalism. (shrink)

The boundless nature of the natural numbers imposes paradoxically a high formal bound to the use of standard artificial computer programs for solving conceptually challenged problems in number theory. In the context of the new cognitive foundations for mathematics' and physics' program immersed in the setting of artificial mathematical intelligence, we proposed a refined numerical system, called the physical numbers, preserving most of the essential intuitions of the natural numbers. Even more, this new numerical structure additionally possesses the property (...) of being a bounded object allowing us to work with quite similar axioms like the classic Peano axioms, but in a finite environment and with an enriched physical dimension. Finally, we present several enlightening examples and we conclude that the physical numbers provide a natural formal setting for approaching classic problems in number theory from a more hybrid perspective, i.e. with a potential participation in the generation of solutions, not only of working mathematicians but also of more sophisticated artificial interactive (mathematical) intelligent agents (within the context of cognitive-computational metamathematics or artificial mathematical intelligence) and more controlled by physically-inspired principles. Finally, this paper addresses a highly new, bottom-up and paradigm-shifting approach to the foundations of physics: One should refine and improve the conceptual formal setting of the language that we use for understanding physical phenomena (e.g. the mathematical grounding concepts and theories) for being able to understand better more subtle and complex physical phenomena. (shrink)

The problem of emergence in physical theories makes necessary to build a general theory of the relationships between the observed system and the observing system. It can be shown that there exists a correspondence between classical systems and computational dynamics according to the Shannon-Turing model. A classical system is an informational closed system with respect to the observer; this characterizes the emergent processes in classical physics as phenomenological emergence. In quantum systems, the analysis based on the computation theory (...) fails. It is here shown that a quantum system is an informational open system with respect to the observer and able to exhibit processes of observational, radical emergence. Finally, we take into consideration the role of computation in describing the physical world. (shrink)

The focal point of this chapter is to discuss the concept of computer regulated testing and its implications in an era of Severe Acute Respiratory Syndrome (SARS) related infection pandemics. This is especially significant because during the outbreak of most SARS-related diseases (like the COVID-19), social and physical distancing is advocated by the government of different nations. SARS-related diseases are caused by a virus known as the coronavirus which affects the respiration of infected persons or animals. These diseases can (...) be spread through air if droplets from an infected get to a non-tainted individual. (shrink)