Implementing Computations

This work-in-progress paper consists of four points which relate to the foundations and physical realization of quantum computing. The first point is that the qubit cannot be taken as the basic unit for quantum computing, because not every superposition of bit-strings of length n can be factored into a string of n-qubits. The second point is that the “No-cloning” theorem does not apply to the copying of one quantum register into another register, because the mathematical representation of this copying is (...) the identity operator, which is manifestly linear. The third point is that quantum parallelism is not destroyed only by environmental decoherence. There are two other forms of decoherence, which we call measurement decoherence and internal decoherence, that can also destroy quantum parallelism. The fourth point is that processing the contents of a quantum register “one qubit at a time” destroys entanglement. (shrink)

Computational complexity has often been ignored in the philosophy of mind, in philosophical artificial intelligence studies. The purpose of this paper is threefold. First and foremost, to show the importance of complexity rather than computability in philosophical and AI problems. Second, to rephrase the notion of computability in terms of solvability, i.e., treating computability as non-sufficient for establishing intelligence. The Church-Turing thesis is therefore revisited and rephrased in order to capture the ontological background of spatial and temporal complexity. Third, to (...) emphasize ontological differences between different time complexities, which seem to provide a solid base for a better understanding of artificial intelligence in general. (shrink)

At its core this book is concerned with logic and computation with respect to the mathematical characterization of sentient biophysical structure and its behavior. -/- Three related theories are presented: The first of these provides an explanation of how sentient individuals come to be in the world. The second describes how these individuals operate. And the third proposes a method for reasoning about the behavior of individuals in groups. -/- These theories are based upon a new explanation of experience in (...) nature, the construction of senses, and motile behavior. This new approach is developed from first principles to enable a rigorous and systematic explanation of the variety of associated intelligent behaviors. -/- Alongside this development is a further account that focuses upon the nature of our work. It discusses the existential aspects of scientific inquiry, its epistemology and logic. It seeks to clarify the nature of the mathematical characterization and computation of natural behaviors, dealing with questions in the foundations of logic. It explores methodological issues related to reduction and the refinement of ideas from intuition to formal logical structure. -/- In support of this inquiry we work toward the development of a calculus for biophysical construction and its dynamics. If successful this mechanics mathematically characterizes sensory and motile behavior. -/- Upon this foundation we propose a model of apprehension and explore how its products are processed by the organism. Finally, we develop a probabilistic theory that enables us to reason about inaccessible factors in group behavior. -/- The mechanics we propose suggests the design and physical realization of a new model of computation; one in which structure and the concurrency of action are a first-order consideration. -/- We identify opportunities for experimental verification of the theory and we suggest a proof of our results in practice by the identification of this mechanism, allowing the construction of machines that experience. (shrink)

Without a proper restriction on mappings, virtually any system could be seen as implementing any computation. That would not allow characterization of systems in terms of implemented computations and is not compatible with a computationalist philosophy of mind. Information-based criteria for independence of substates within structured states are proposed as a solution. Objections to the use of requirements for transitions in counterfactual states are addressed, in part using the partial-brain argument as a general counterargument to neural replacement arguments.

The biomedical literature makes extensive use of the concept of a genetic program. So far, however, the nature of genetic programs has received no satisfactory elucidation from the standpoint of computer science. This unsettling omission has led to doubts about the very existence of genetic programs, on the grounds that gene regulatory networks lack a predetermined schedule of execution, which may seem to contradict the very idea of a program. I show, however, that we can make perfect sense of genetic (...) programs, if only we abandon the preconception that all computers have a von Neumann architecture. Instead, genetic programs instantiate the computational architecture of Post–Newell Production Systems. That is, genetic programs are unordered sets of conditional instructions, instructions that fire independently when their conditions are matched. For illustration I present a paradigm Production System that regulates the functioning of the well-known lac operon of E. coli. On close reflection it turns out that not only genes, but also proteins encode instructions. I propose, therefore, to rename genetic programs to biomolecular programs. Biomolecular and/or genetic programs, and the cellular computers than run them, are to be understood not as von Neumann computers, but as Post–Newell production systems. (shrink)

What is computational explanation? Many accounts treat it as a kind of causal explanation. I argue against two more specific versions of this view, corresponding to two popular treatments of causal explanation. The first holds that computational explanation is mechanistic, while the second holds that it is interventionist. However, both overlook an important class of computational explanations, which I call limitative explanations. Limitative explanations explain why certain problems cannot be solved computationally, either in principle or in practice. I argue that (...) limitative explanations are not plausibly understood in either mechanistic or interventionist terms. One upshot of this argument is that there are causal and non-causal kinds of computational explanation. I close the paper by suggesting that both are grounded in the notion of computational implementation. (shrink)

This note discusses the account of physical computation offered in Part II of Primiero’s On the Foundations of Computing. Although there is much to find attractive about the account, I argue that the account is obscure at certain crucial junctures and that it does not supply a wholly satisfactory account of miscomputation. I close by considering whether the engineering foundation of computing requires a theory of physical computation in the first place, suggesting tentatively that it does not.

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)

The received view of computation is methodologically bifurcated: it offers different accounts of computation in the mathematical and physical cases. But little in the way of argument has been given for this approach. This article rectifies the situation by arguing that the alternative, a unified account, is untenable. Furthermore, once these issues are brought into sharper relief we can see that work remains to be done to illuminate the relationship between physical and mathematical computation.

A skeptical worry known as ‘the indeterminacy of computation’ animates much recent philosophical reflection on the computational identity of physical systems. On the one hand, computational explanation seems to require that physical computing systems fall under a single, unique computational description at a time. On the other, if a physical system falls under any computational description, it seems to fall under many simultaneously. Absent some principled reason to take just one of these descriptions in particular as relevant for computational explanation, (...) widespread failure of computational explanation would appear to follow. This paper advances a new solution to the indeterminacy of computation. Very roughly, I argue that the computational identity of a physical system is determinate relative to a contextually specified way of regarding that system computationally—known as a labelling scheme. When a system simultaneously implements multiple computations, it does so relative to different labelling schemes. But relative to a fixed labelling scheme, a physical system has a unique computational identity. I argue that this relativistic conception of computational identity vindicates computational explanation in the face of simultaneous implementation. (shrink)

Purpose: The research explored empirical evidence to assess the impact of cyber security and supply chain risk on digital operations in the UAE pharmaceutical industry. Methodology/Design/Approach: Based on responses from 243 personnel working at 14 pharmaceutical manufacturing companies in Dubai, data were examined for normality, instrument validity and regression analysis. Cyber security and SC risk on digital operations were explored by applying convenient sampling and descriptive and analytical research design. Findings: The findings validated the significant positive association between cyber security (...) and supply chain risk with digital operations. Research implications and Limitations: The research model was developed with three variables evaluated only on the pharmaceutical industry in Dubai. Future research should focus on multiple manufacturing industries by covering a larger geographic area. Practical implications: When suppliers are highly concentrated, customer-focused organisations with uncertain levels of digital transformation could improve their ability to manage supply chain risk by diversifying their clients. Pharmaceutical firms may require a greater focus on technology-based manufacturing firms to build and maintain customer trust. Originality Value: To illustrate how the pharmaceutical industry has explored the relationship between cyber security, supply chain risk and digital operations, the research highlights the significant and convoluted consequences of the relationship model that have not been previously considered. (shrink)

This paper considers hybrid systems — dynamical systems that exhibit both continuous and discrete behavior. Usually, in these systems, interactions between the continuous and discrete dynamics occur when a pre-defined function becomes equal to zero, i.e., in the system occurs a zero-crossing (the situation where the function only “touches” zero is considered as the zero-crossing, as well). Determination of zero-crossings plays a crucial role in the correct simulation of the system in this case. However, for models of many real-life hybrid (...) systems, such interactions may lead to the so-called Zeno executions, i.e., situations where the system undergoes an unbounded number of discrete transitions in a finite and bounded length of time. In this case, standard numerical methods of simulating the systems may fail, since the time between two transitions can decrease significantly leading to ill-conditioning of the simulation. Correct determination of zero-crossings for a complex real-life system can require a lot of computational resources and, as a consequence, slow down the simulation significantly. This paper presents a new way to execute the simulation generating time observations of the hybrid system dynamically using numerical infinitesimals introduced recently, allowing thus to determine zero-crossings more accurately. The proposed method allows to automatically detect zero-crossings with predefined accuracy and to analyze better the behavior of the system around the zero-crossings generating observations more densely, where it is necessary. Moreover, the search for zero-crossings is performed efficiently without re-evaluation of the whole system at each observation. To show the validity of the proposed algorithm, the well-known Bouncing Ball hybrid system has been studied and the obtained simulation results were compared with the standard method. (shrink)

David Christensen and others argue that Dutch Strategies are more like peer disagreements than Dutch Books, and should not count against agents‘ conformity to ideal rationality. I review these arguments, then show that Dutch Books, Dutch Strategies, and peer disagreements are only possible in the case of what computer scientists call Byzantine Failures—uncorrected Byzantine Faults which update arbitrary values. Yet such Byzantine Failures make agents equally vulnerable to all three kinds of epistemic inconsistencies, so there is no principled basis for (...) claiming that only avoidance of true Dutch Books characterizes ideally rational agents. Agents without Byzantine Failures can be ideally rational in a very strong sense, but are not normative for humans. (shrink)

“Morphological computation” is an increasingly important concept in robotics, artificial intelligence, and philosophy of the mind. It is used to understand how the body contributes to cognition and control of behavior. Its understanding in terms of "offloading" computation from the brain to the body has been criticized as misleading, and it has been suggested that the use of the concept conflates three classes of distinct processes. In fact, these criticisms implicitly hang on accepting a semantic definition of what constitutes computation. (...) Here, I argue that an alternative, mechanistic view on computation offers a significantly different understanding of what morphological computation is. These theoretical considerations are then used to analyze the existing research program in developmental biology, which understands morphogenesis, the process of development of shape in biological systems, as a computational process. This important line of research shows that cognition and intelligence can be found across all scales of life, as the proponents of the basal cognition research program propose. Hence, clarifying the connection between morphological computation and morphogenesis allows for strengthening the role of the former concept in this emerging research field. (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)

This article advertises a new account of computational implementation. According to the resemblance account, implementation is a matter of resembling a computational architecture. The resemblance account departs from previous theories by denying that computational architectures are exhausted by their formal, mathematical features. Instead, they are taken to be permeated with causality, spatiotemporality, and other nonmathematical features. I argue that this approach comports well with computer scientific practice and offers a novel response to so-called triviality arguments.

This paper is dedicated to numerical computation of higher order derivatives in Simulink. In this paper, a new module has been implemented to achieve this purpose within the Simulink-based Infinity Computer solution, recently introduced by the authors. This module offers several blocks to calculate higher order derivatives of a function given by the arithmetic operations and elementary functions. Traditionally, this can be done in Simulink using finite differences only, for which it is well-known that they can be characterized by instability (...) and low accuracy. Moreover, the proposed module allows to calculate higher order Lie derivatives embedded in the numerical solution to Ordinary Differential Equations (ODEs). Traditionally, Simulink does not offer any practical solution for this case without using difficult external libraries and methodologies, which are domain-specific, not general-purpose and have their own limitations. The proposed differentiation module bridges this gap, is simple and does not require any additional knowledge or skills except basic knowledge of the Simulink programming language. Finally, the block for constructing the Taylor expansion of the differentiated function is also proposed, adding so another efficient numerical method for solving ODEs and for polynomial approximation of the functions. Numerical experiments on several classes of test problems confirm advantages of the proposed solution. (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)

We show that the so-called Multiple-Computations Theorem in cognitive science and philosophy of mind challenges Landauer’s Principle in physics. Since the orthodox wisdom in statistical physics is that Landauer’s Principle is implied by, or is the mechanical equivalent of, the Second Law of thermodynamics, our argument shows that the Multiple-Computations Theorem challenges the universal validity of the Second Law of thermodynamics itself. We construct two examples of computations carried out by one and the same dynamical process with respect to which (...) Landauer’s principle implies contradictory predictions concerning the entropy increase. Our two examples are based on a weak version of the Multiple-Computations Theorem, which is quite uncontroversial, and therefore they amount to a clear refutation of the universal validity of Landauer’s Principle. We consider some responses to this argument that do not attempt to single out one computation over the others, and we show that they do not work. We further consider ways out of the argument by externalist approaches supporting the computational theory of the mind who propose that the interaction of a computing system with the environment is enough to select a single computation over the others. We show on physical grounds that this approach fails too. We then reverse the direction of our challenge and formulate a dilemma for supporters of the computational theory of the mind: they must reject the causal closure of physic; or else they must accept on a priori grounds that Landauer’s Principle and the Second Law of thermodynamics are not universally valid. Finally, we present our version of a type–type mind-brain identity theory called Flat Physicalism, which is based on the paradigm case of statistical mechanics, and we show that it circumvents the challenge from Landauer’s Principle and the Multiple-Computations Theorem and does not fall prey to our dilemma. (shrink)

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and (...) they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics. (shrink)

This article investigates religious ideals persistent in the datafication of information society. Its nodal point is Thomas Bayes, after whom Laplace names the primal probability algorithm. It reconsiders their mathematical innovations with Laplace's providential deism and Bayes' singular theological treatise. Conceptions of divine justice one finds among probability theorists play no small part in the algorithmic data-mining and microtargeting of Cambridge Analytica. Theological traces within mathematical computation are emphasized as the vantage over large numbers shifts to weights beyond enumeration in (...) probability theory. Collateral secularizations of predestination and theodicy emerge as probability optimizes into Bayesian prediction and machine learning. The paper revisits the semiotics and theism of Peirce and a given beyond the probable in Whitehead to recontextualize the critiques of providence by Agamben and Foucault. It reconsiders datafication problems alongside Nietzschean valuations. Religiosity likely remains encoded within the very algorithms presumed purified by technoscientific secularity or mathematical dispassion. (shrink)

This article is a knowledge technology case study of DNAOS, a distributed platform for Knowledge Resource Entitlement, Modeling, Management, and Sharing (KREMMS). Some historical aspects of its design, development, and release are briefly discussed, after which the DNAOS technology is commented upon from the specific viewpoint of KREMMS. At the core of this platform is the conception of knowledge as a natural phenomenon, which conception is reflected in the ontology of this technology: Fundamental knowledge structures and structuring principles, believed to (...) be “natural,” including qualification, resources, and relationships, are considered theoretically and modeled computationally. Finally, with the help of images, the reader is briefly introduced to some DNAOS capabilities, touching on transaction, application, data, model, and interface. (shrink)

We examine two very different approaches to formalising real computation, commonly referred to as “Computable Analysis” and “the BSS approach”. The main models of computation underlying these approaches—bit computation and BSS, respectively—have also been put forward as appropriate foundations for scientific computing. The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space. Since typically the problems dealt with in physical sciences, applied mathematics, economics, and engineering are also defined in uncountable domains, it (...) is fitting that we choose between these two approaches a foundational framework for scientific computing. However, the models are incompatible as to their results. What is more, the BSS model is highly idealised and unrealistic; yet, it is the de facto implicit model in various areas of computational mathematics, with virtually no problems for the everyday practice. This paper serves three purposes. First, we attempt to delineate what the goal of developing foundations for scientific computing exactly is. We distinguish between two very different interpretations of that goal, and on the separate basis of each one, we put forward answers about the appropriateness of each framework. Second, we provide an account of the fruitfulness and wide use of BSS, despite its unrealistic assumptions. Third, according to one of our proposed interpretations of the scope of foundations, the target domain of both models is a certain mathematical structure. In a clear sense, then, we are using idealised models to study a purely mathematical structure. The third purpose is to point out and explain this intriguing phenomenon and attempt to make connections with the typical case of idealised models of empirical domains. (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)

I analyze a tension at the core of the mechanistic view of computation generated by its joint commitment to the medium independence of computational vehicles and to computational systems possessing teleological functions to compute. While computation is individuated in medium-independent terms, teleology is sensitive to the constitutive physical properties of vehicles. This tension spells trouble for the mechanistic view, suggesting that there can be no teleological functions to compute. I argue that, once considerations about the relevant function-bestowing factors for computational (...) systems are brought to bear, the tension dissolves: physical systems can have the teleological function to compute. (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)

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 aim of this paper is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a computational interpretation as an ordered pair of functions mapping (1) states of a physical system to states of an abstract machine, and (2) inputs to this machine to interventions in this physical system. This interpretation must ensure that counterfactuals true of the abstract machine have appropriate counterparts which are (...) true of the physical system. The criterion proposes that rival interpretations be assessed on the basis of simplicity. Simplicity is construed as the Kolmogorov complexity of the interpretation. This approach is closely related to the notion of algorithmic information distance and draws on earlier work on real patterns. (shrink)

Computing, today more than ever before, is a multi-faceted discipline which collates several methodologies, areas of interest, and approaches: mathematics, engineering, programming, and applications. Given its enormous impact on everyday life, it is essential that its debated origins are understood, and that its different foundations are explained. On the Foundations of Computing offers a comprehensive and critical overview of the birth and evolution of computing, and it presents some of the most important technical results and philosophical problems of the discipline, (...) combining both historical and systematic analyses. -/- The debates this text surveys are among the latest and most urgent ones: the crisis of foundations in mathematics and the birth of the decision problem, the nature of algorithms, the debates on computational artefacts and malfunctioning, and the analysis of computational experiments. By covering these topics, On the Foundations of Computing provides a much-needed resource to contextualize these foundational issues. -/- For practitioners, researchers, and students alike, a historical and philosophical approach such as what this volume offers becomes essential to understand the past of the discipline and to figure out the challenges of its future. (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)

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)

ABSTRACT Shagrir and Sprevak explore the apparent necessity of representation for the individuation of digits in computational systems.1 1 I will first offer a response to Sprevak’s argument that does not mention Shagrir’s original formulation, which was more complex. I then extend my initial response to cover Shagrir’s argument, thus demonstrating that it is possible to individuate digits in non-representational computing mechanisms. I also consider the implications that the non-representational individuation of digits would have for the broader theory of computing (...) mechanisms. 1 The Received View: No Computation without Representation 2 Computing Mechanisms and Functional Individuation 3 Against Computational Externalism 4 Implications for the Mechanistic Account. (shrink)

São duas formas distintas para o futuro do trabalhona era dos robôs. Estas formas servem tanto para as redes, quanto fora delas, e exceto pelos processos serem reais ou virtuais, os resultados são equipotentes. A primeira,forma,e mais atual, é a convivência entre maquinas e pessoas de um modomais ou menos harmonioso, cada qual com suas funções, com poucas sobreposições. A segunda é uma forma, onde os robôs fazem o trabalho da humanidade, substituindo completamente a maioria dospostos, e esta formapode tanto (...) ser boaquantoruim. Não é difícil perceber, quehoje, com os trabalhos remotos, trabalhos em horários alternativos,e também os temporários,a forma do trabalhotem outra dimensão, não apenas pelos seus métodos, mas também, e de um modo que a meu ver é preocupante:a forma de organização dos próprios trabalhadores. Justamente devido esta não organização existe uma grandeprobabilidade que no futuro sindicatos ou mesmo associações sejam raros ou extintos.Este ensaio é uma tentativa de reunir algumas visões, para quepossamos perceber o rumo que a tecnologia está tomando. (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)

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)

Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states. In this paper, I propose a novel constraint on the kinds of physical states that can implement computational states, which helps to specify what it is for two physical states to non-trivially implement the same (...) computational state. (shrink)

Just as theory of representation is deficient if it can’t explain how misrepresentation is possible, a theory of computation is deficient if it can’t explain how miscomputation is possible. Nonetheless, philosophers have generally ignored miscomputation. My primary goal in this paper is to clarify both what miscomputation is and how to adequately explain it. Miscomputation is a special kind of malfunction: a system miscomputes when it computes in a way that it shouldn’t. To explain miscomputation, you must provide accounts of (...) computational behavior, computational norms, and how computational behavior can deviate from computational norms. A secondary goal of this paper is to defend an (quasi-)individualist, mechanistic theory of miscomputation. Computational behavior is narrowly individuated. Computational norms are widely individuated. A system miscomputes when its behavior manifests a narrow computational structure that the widely individuated norms say that it should not have. (shrink)

Cognitive science is considered to be the study of mind (consciousness and thought) and intelligence in humans. Under such definition variety of unsolved/unsolvable problems appear. This article argues for a broad understanding of cognition based on empirical results from i.a. natural sciences, self-organization, artificial intelligence and artificial life, network science and neuroscience, that apart from the high level mental activities in humans, includes sub-symbolic and sub-conscious processes, such as emotions, recognizes cognition in other living beings as well as extended and (...) distributed/social cognition. The new idea of cognition as complex multiscale phenomenon evolved in living organisms based on bodily structures that process information, linking cognitivists and EEEE (embodied, embedded, enactive, extended) cognition approaches with the idea of morphological computation (info-computational self-organisation) in cognizing agents, emerging in evolution through interactions of a (living/cognizing) agent with the environment. (shrink)

The assumption that psychological states and processes are computational in character pervades much of cognitive science, what many call the computational theory of mind. In addition to occupying a central place in cognitive science, the computational theory of mind has also had a second life supporting “individualism”, the view that psychological states should be taxonomized so as to supervene only on the intrinsic, physical properties of individuals. One response to individualism has been to raise the prospect of “wide computational systems”, (...) in which some computational units are instantiated outside the individual. “Wide computationalism” attempts to sever the link between individualism and computational psychology by enlarging the concept of computation. However, in spite of its potential interest to cognitive science, wide computationalism has received little attention in philosophy of mind and cognitive science. This paper aims to revisit the prospect of wide computationalism. It is argued that by appropriating a mechanistic conception of computation wide computationalism can overcome several issues that plague initial formulations. The aim is to show that cognitive science has overlooked an important and viable option in computational psychology. The paper marshals empirical support and responds to possible objections. (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)

This chapter subsumes David Marr’s levels of analysis account of explanation in cognitive science under the framework of mechanistic explanation: Answering the questions that define each one of Marr’s three levels is tantamount to describing the component parts and operations of mechanisms, as well as their organization, behavior, and environmental context. By explicating these questions and showing how they are answered in several different cognitive science research programs, this chapter resolves some of the ambiguities that remain in Marr’s account, and (...) shows that many different areas and traditions of cognitive scientific research can be unified under the mechanistic framework. (shrink)

Despite the impressive amount of financial resources recently invested in carrying out large-scale brain simulations, it is controversial what the pay-offs are of pursuing this project. One idea is that from designing, building, and running a large-scale neural simulation, scientists acquire knowledge about the computational performance of the simulating system, rather than about the neurobiological system represented in the simulation. It has been claimed that this knowledge may usher in a new era of neuromorphic, cognitive computing systems. This study elucidates (...) this claim and argues that the main challenge this era is facing is not the lack of biological realism. The challenge lies in identifying general neurocomputational principles for the design of artificial systems, which could display the robust flexibility characteristic of biological intelligence. (shrink)

A computational theory of consciousness should include a quantitative measure of consciousness, or MoC, that (i) would reveal to what extent a given system is conscious, (ii) would make it possible to compare not only different systems, but also the same system at different times, and (iii) would be graded, because so is consciousness. However, unless its design is properly constrained, such an MoC gives rise to what we call the boundary problem: an MoC that labels a system as conscious (...) will do so for some – perhaps most – of its subsystems, as well as for irrelevantly extended systems (e.g., the original system augmented with physical appendages that contribute nothing to the properties supposedly supporting consciousness), and for aggregates of individually conscious systems (e.g., groups of people). This problem suggests that the properties that are being measured are epiphenomenal to consciousness, or else it implies a bizarre proliferation of minds. We propose that a solution to the boundary problem can be found by identifying properties that are intrinsic or systemic: properties that clearly differentiate between systems whose existence is a matter of fact, as opposed to those whose existence is a matter of interpretation (in the eye of the beholder). We argue that if a putative MoC can be shown to be systemic, this ipso facto resolves any associated boundary issues. As test cases, we analyze two recent theories of consciousness in light of our definitions: the Integrated Information Theory and the Geometric Theory of consciousness. (shrink)

Explanations in cognitive science and computational neuroscience rely predominantly on computational modeling. Although the scientific practice is systematic, and there is little doubt about the empirical value of numerous models, the methodological account of computational explanation is not up-to-date. The current chapter offers a systematic account of computational explanation in cognitive science and computational neuroscience within a mechanistic framework. The account is illustrated with a short case study of modeling of the mirror neuron system in terms of predictive coding.

Interest in the computational aspects of modeling has been steadily growing in philosophy of science. This paper aims to advance the discussion by articulating the way in which modeling and computational errors are related and by explaining the significance of error management strategies for the rational reconstruction of scientific practice. To this end, we first characterize the role and nature of modeling error in relation to a recipe for model construction known as Euler’s recipe. We then describe a general model (...) that allows us to assess the quality of numerical solutions in terms of measures of computational errors that are completely interpretable in terms of modeling error. Finally, we emphasize that this type of error analysis involves forms of perturbation analysis that go beyond the basic model-theoretical and statistical/probabilistic tools typically used to characterize the scientific method; this demands that we revise and complement our reconstructive toolbox in a way that can affect our normative image of science. (shrink)

Morphological Computation is based on the observation that biological systems seem to carry out relevant computations with their morphology (physical body) in order to successfully interact with their environments. This can be observed in a whole range of systems and at many different scales. It has been studied in animals – e.g., while running, the functionality of coping with impact and slight unevenness in the ground is "delivered" by the shape of the legs and the damped elasticity of the muscle-tendon (...) system – and plants, but it has also been observed at the cellular and even at the molecular level – as seen, for example, in spontaneous self-assembly. The concept of morphological computation has served as an inspirational resource to build bio-inspired robots, design novel approaches for support systems in health care, implement computation with natural systems, but also in art and architecture. As a consequence, the field is highly interdisciplinary, which is also nicely reflected in the wide range of authors that are featured in this e-book. We have contributions from robotics, mechanical engineering, health, architecture, biology, philosophy, and others. (shrink)

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)

In the 21st century with the exponential growth of the Internet, the vulnerability of the network which connects us is on the rise at a very fast pace. Today organizations are spending millions of dollars to protect their sensitive data from different vulnerabilities that they face every day. In this paper, a new methodology towards implementing an Intrusion Detection & Prevention System (IDPS) based on Artificial Neural Network (ANN) onto Field Programmable Gate Array (FPGA) is proposed. This system not only (...) detects different network attacks but also prevents them from being propagated. The parallel structure of an ANN makes it potentially fast for the computation of certain tasks. FPGA platforms are the optimum and best choice for the modern digital systems nowadays. The same feature makes ANN well suited for implementation in FPGA technology. Hardware realization of ANN to a large extent depends on the efficient implementation of a single neuron. However FPGA realization of ANNs with a large number of neurons is still a challenging task. The proposed multilayer ANN based IDPS uses multiple neurons for higher performance and greater accuracy. Simulation of the design in MATLAB SIMULINK 2010b by using Knowledge Discovery and Data Mining (KDD) CUP dataset shows a very good performance. Subsequently MATLAB HDL coder was used to generate VHDL code for the proposed design that produced Intellectual Property (IP) cores for Xilinx Targeted Design Platforms. For evaluation purposes the proposed design was synthesized, implemented and tested onto Xilinx Virtex-7 2000T FPGA device. eww141009dxn. (shrink)