Modern semiotics is a branch of logics that formally defines symbol-based communication. In recent years, the semiotic classification of signs has been invoked to support the notion that symbols are uniquely human. Here we show that alarm-calls such as those used by African vervet monkeys (Cercopithecus aethiops), logically satisfy the semiotic definition of symbol. We also show that the acquisition of vocal symbols in vervet monkeys can be successfully simulated by a computer program based on minimal semiotic (...) and neurobiological constraints. The simulations indicate that learning depends on the tutor-predator ratio, and that apprentice-generated auditory mistakes in vocal symbol interpretation have little effect on the learning rates of apprentices (up to 80% of mistakes are tolerated). In contrast, just 10% of apprentice-generated visual mistakes in predator identification will prevent any vocal symbol to be correctly associated with a predator call in a stable manner. Tutor unreliability was also deleterious to vocal symbol learning: a mere 5% of “lying” tutors were able to completely disrupt symbol learning, invariably leading to the acquisition of incorrect associations by apprentices. Our investigation corroborates the existence of vocal symbols in a non-human species, and indicates that symbolic competence emerges spontaneously from classical associative learning mechanisms when the conditioned stimuli are self-generated, arbitrary and socially efficacious. We propose that more exclusive properties of human language, such as syntax, may derive from the evolution of higher-order domains for neural association, more removed from both the sensory input and the motor output, able to support the gradual complexification of grammatical categories into syntax. (shrink)

This paper proposes an extensionalist analysis of computer simulations (CSs). It puts the emphasis not on languages nor on models, but on symbols, on their extensions, and on their various ways of referring. It shows that chains of reference of symbols in CSs are multiple and of different kinds. As they are distinct and diverse, these chains enable different kinds of remoteness of reference and different kinds of validation for CSs. Although some methodological papers have already underlined the role (...) of these various relationships of reference in CSs and of cross-validations, this diversity is still overlooked in the epistemological literature on CSs. As a consequence, a particular outcome of this analytical view is an ability to classify existing epistemological theses on CSs according to what their authors choose to select and put at the forefront: either the extensions of symbols, or the symbol-types, or the symbol-tokens, or the internal denotational hierarchies of the CS or the reference of these hierarchies to external denotational hierarchies. Through the adoption of this extensionalist view, it also becomes possible to explain more precisely the reasons why some complete reduction of CSs to classical epistemic paradigms such as “experiment” or “theoretical argument” remains doubtful. On this last point, in particular, this paper is in agreement with what many epistemologists already have acknowledged. (shrink)

Today, artificial intelligence, especially machine learning, is structurally dependent on human participation. Technologies such as Deep Learning (DL) leverage networked media infrastructures and human-machine interaction designs to harness users to provide training and verification data. The emergence of DL is therefore based on a fundamental socio-technological transformation of the relationship between humans and machines. Rather than simulating human intelligence, DL-based AIs capture human cognitive abilities, so they are hybrid human-machine apparatuses. From a perspective of media philosophy and social-theoretical (...) critique, I differentiate five types of “media technologies of capture” in AI apparatuses and analyze them as forms of power relations between humans and machines. Finally, I argue that the current hype about AI implies a relational and distributed understanding of (human/artificial) intelligence, which I categorize under the term “cybernetic AI”. This form of AI manifests in socio-technological apparatuses that involve new modes of subjectivation, social control and discrimination of users. (shrink)

The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So it is with (...) computing, which can be analog or digital, and is often mixed. The theory behind computers is essentially digital, but efficient simulations of phenomena can be performed by analog devices; indeed, any physical calculation requires implementation in the physical world and is therefore analog to some extent, despite being based on abstract logic and arithmetic. The mammalian brain, comprised of neuronal networks, functions as an analog device and has given rise to artificial neural networks that are implemented as digital algorithms but function as analog models would. Analog constructs compute with the implementation of a variety of feedback and feedforward loops. In contrast, digital algorithms allow the implementation of recursive processes that enable them to generate unparalleled emergent properties. We briefly illustrate how the cortical organization of neurons can integrate signals and make predictions analogically. While we conclude that brains are not digital computers, we speculate on the recent implementation of human writing in the brain as a possible digital path that slowly evolves the brain into a genuine (slow) Turing machine. (shrink)

The emerging contemporary natural philosophy provides a common ground for the integrative view of the natural, the artificial, and the human-social knowledge and practices. Learning process is central for acquiring, maintaining, and managing knowledge, both theoretical and practical. This paper explores the relationships between the present advances in understanding of learning in the sciences of the artificial (deep learning, robotics), natural sciences (neuroscience, cognitive science, biology), and philosophy (philosophy of computing, philosophy of mind, natural philosophy). The question (...) is, what at this stage of the development the inspiration from nature, specifically its computational models such as info-computation through morphological computing, can contribute to machine learning and artificial intelligence, and how much on the other hand models and experiments in machine learning and robotics can motivate, justify, and inform research in computational cognitive science, neurosciences, and computing nature. We propose that one contribution can be understanding of the mechanisms of ‘learning to learn’, as a step towards deep learning with symbolic layer of computation/information processing in a framework linking connectionism with symbolism. As all natural systems possessing intelligence are cognitive systems, we describe the evolutionary arguments for the necessity of learning to learn for a system to reach human-level intelligence through evolution and development. The paper thus presents a contribution to the epistemology of the contemporary philosophy of nature. (shrink)

Critical in the computationalist account of the mind is the phenomenon called computational or computer simulation of human thinking, which is used to establish the theses that human thinking is a computational process and that computing machines are thinking systems. Accordingly, if human thinking can be simulated computationally then human thinking is a computational process; and if human thinking is a computational process then its computational simulation is itself a thinking process. This paper shows that the said (...) phenomenon—the computational simulation of human thinking—is ill-conceived, and that, as a consequence, the theses that it intends to establish are problematic. It is argued that what is simulated computationally is not human thinking as such but merely its behavioral manifestations; and that a computational simulation of these behavioral manifestations does not necessarily establish that human thinking is computational, as it is logically possible for a non-computational system to exhibit behaviors that lend themselves to a computational simulation. (shrink)

In this paper we shed new light on the Argument from Disagreement by putting it to test in a computer simulation. According to this argument widespread and persistent disagreement on ethical issues indicates that our moral opinions are not influenced by any moral facts, either because no such facts exist or because they are epistemically inaccessible or inefficacious for some other reason. Our simulation shows that if our moral opinions were influenced at least a little bit by (...) moral facts, we would quickly have reached consensus, even if our moral opinions were affected by factors such as false authorities, external political shifts, and random processes. Therefore, since no such consensus has been reached, the simulation gives us increased reason to take seriously the Argument from Disagreement. Our conclusion is however not conclusive; the simulation also indicates what assumptions one has to make in order to reject the Argument from Disagreement. The simulation algorithm we use builds on the work of Hegselmann and Krause (J Artif Soc Social Simul 5(3); 2002, J Artif Soc Social Simul 9(3), 2006). (shrink)

The emerging contemporary natural philosophy provides a common ground for the integrative view of the natural, the artificial, and the human-social knowledge and practices. Learning process is central for acquiring, maintaining, and managing knowledge, both theoretical and practical. This paper explores the relationships between the present advances in understanding of learning in the sciences of the artificial, natural sciences, and philosophy. The question is, what at this stage of the development the inspiration from nature, specifically its computational models (...) such as info-computation through morphological computing, can contribute to machine learning and artificial intelligence, and how much on the other hand models and experiments in machine learning and robotics can motivate, justify, and inform research in computational cognitive science, neurosciences, and computing nature. We propose that one contribution can be understanding of the mechanisms of ‘learning to learn’, as a step towards deep learning with symbolic layer of computation/information processing in a framework linking connectionism with symbolism. As all natural systems possessing intelligence are cognitive systems, we describe the evolutionary arguments for the necessity of learning to learn for a system to reach humanlevel intelligence through evolution and development. The paper thus presents a contribution to the epistemology of the contemporary philosophy of nature. (shrink)

In computer science, Artificial Intelligence (AI), sometimes called machine intelligence, is intelligence demonstrated by machines, in contrast to the natural intelligence displayed by humans and other animals. Computer science defines AI research as the study of "intelligent agents": any device that perceives its environment and takes actions that maximize its chance of successfully achieving its goals. Deep Learning is a new field of research. One of the branches of Artificial Intelligence Science deals with the creation of theories (...) and algorithms that allow the machine to learn by simulating neurons in the human body. Most in-depth learning research focuses on finding high-level methods. The strippers analyze a large data set using linear and nonlinear transformations. The method of deep learning is used in the detection of several diseases including blood cell diseases and their classification using the radiography of blood cells to help decision makers to know the type of blood cell and its associated diseases and the results will be presented in detail and discussed. This thesis is using python language and deep learning to detect blood cell diseases and their classifications. The proposed deep learning model was trained, validated and the tested. The accuracy of proposed model was 98.00%. (shrink)

This paper defends the naïve thesis that the method of experiment has per se an epistemic superiority over the method of computer simulation, a view that has been rejected by some philosophers writing about simulation, and whose grounds have been hard to pin down by its defenders. I further argue that this superiority does not come from the experiment’s object being materially similar to the target in the world that the investigator is trying to learn about, as (...) both sides of dispute over the epistemic superiority thesis have assumed. The superiority depends on features of the question and on a property of natural kinds that has been mistaken for material similarity. Seeing this requires holding other things equal in the comparison of the two methods, thereby exposing that, under the conditions that will be specified, the simulation is necessarily epistemically one step behind the corresponding experiment. Practical constraints like feasibility and morality mean that scientists do not often face an other-things- equal comparison when they choose between experiment and simulation. Nevertheless, I argue, awareness of this superiority and of the general distinction between experiment and simulation is important for maintaining motivation to seek answers to new questions. (shrink)

This paper defends the naïve thesis that the method of experiment has per se an epistemic superiority over the method of computer simulation, a view that has been rejected by some philosophers writing about simulation, and whose grounds have been hard to pin down by its defenders. I further argue that this superiority does not come from the experiment’s object being materially similar to the target in the world that the investigator is trying to learn about, as (...) both sides of dispute over the epistemic superiority thesis have assumed. The superiority depends on features of the question and on a property of natural kinds that has been mistaken for material similarity. Seeing this requires holding other things equal in the comparison of the two methods, thereby exposing that, under the conditions that will be specified, the simulation is necessarily epistemically one step behind the corresponding experiment. Practical constraints like feasibility and morality mean that scientists do not often face an other-things- equal comparison when they choose between experiment and simulation. Nevertheless, I argue, awareness of this superiority and of the general distinction between experiment and simulation is important for maintaining motivation to seek answers to new questions. (shrink)

A recent evolution of computer simulations has led to the emergence of complex computer simulations. In particular, the need to formalize composite objects (those objects that are composed of other objects) has led to what the author suggests calling pluriformalizations, i.e. formalizations that are based on distinct sub-models which are expressed in a variety of heterogeneous symbolic languages. With the help of four case-studies, he shows that such pluriformalizations enable to formalize distinctly but simultaneously either different aspects or (...) different parts or different scales of the same object or system. From an epistemological standpoint, he suggests that this kind of computer-aided complex formalization of composite objects renew the traditional relations between computer simulations, theoretical models and operational models. (shrink)

In an attempt to determine the epistemic status of computer simulation results, philosophers of science have recently explored the similarities and differences between computer simulations and experiments. One question that arises is whether and, if so, when, simulation results constitute novel empirical data. It is often supposed that computer simulation results could never be empirical or novel because simulations never interact with their targets, and cannot go beyond their programming. This paper argues against this (...) position by examining whether, and under what conditions, the features of empiricality and novelty could be displayed by computer simulation data. I show that, to the extent that certain familiar measurement results have these features, so can some computer simulation results. (shrink)

Simulation models of the Reiterated Prisoner's Dilemma have been popular for studying the evolution of cooperation since more than 30 years now. However, there have been practically no successful instances of empirical application of any of these models. At the same time this lack of empirical testing and confirmation has almost entirely been ignored by the modelers community. In this paper, I examine some of the typical narratives and standard arguments with which these models are justified by their authors (...) despite the lack of empirical validation. I find that most of the narratives and arguments are not at all compelling. None the less they seem to serve an important function in keeping the simulation business running despite its empirical shortcomings. (shrink)

Now that complex Agent-Based Models and computer simulations spread over economics and social sciences - as in most sciences of complex systems -, epistemological puzzles (re)emerge. We introduce new epistemological tools so as to show to what precise extent each author is right when he focuses on some empirical, instrumental or conceptual significance of his model or simulation. By distinguishing between models and simulations, between types of models, between types of computer simulations and between types of empiricity, (...) section 2 gives conceptual tools to explain the rationale of the diverse epistemological positions presented in section 1. Finally, we claim that a careful attention to the real multiplicity of denotational powers of symbols at stake and then to the implicit routes of references operated by models and computer simulations is necessary to determine, in each case, the proper epistemic status and credibility of a given model and/or simulation. (shrink)

This book addresses key conceptual issues relating to the modern scientific and engineering use of computer simulations. It analyses a broad set of questions, from the nature of computer simulations to their epistemological power, including the many scientific, social and ethics implications of using computer simulations. The book is written in an easily accessible narrative, one that weaves together philosophical questions and scientific technicalities. It will thus appeal equally to all academic scientists, engineers, and researchers in industry (...) interested in questions related to the general practice of computer simulations. (shrink)

While Thomas Kuhn's theory of scientific revolutions does not specifically deal with validation, the validation of simulations can be related in various ways to Kuhn's theory: 1) Computer simulations are sometimes depicted as located between experiments and theoretical reasoning, thus potentially blurring the line between theory and empirical research. Does this require a new kind of research logic that is different from the classical paradigm which clearly distinguishes between theory and empirical observation? I argue that this is not the (...) case. 2) Another typical feature of computer simulations is their being ``motley'' (Winsberg 2003) with respect to the various premises that enter into simulations. A possible consequence is that in case of failure it can become difficult to tell which of the premises is to blame. Could this issue be understood as fostering Kuhn's mild relativism with respect to theory choice? I argue that there is no need to worry about relativism with respect to computer simulations, in particular. 3) The field of social simulations, in particular, still lacks a common understanding concerning the requirements of empirical validation of simulations. Does this mean that social simulations are still in a pre-scientific state in the sense of Kuhn? My conclusion is that despite ongoing efforts to promote quality standards in this field, lack of proper validation is still a problem of many published simulation studies and that, at least large parts of social simulations must be considered as pre-scientific. (shrink)

A recent evolution of computer simulations has led to the emergence of complex computer simulations. In particular, the need to formalize composite objects (those objects that are composed of other objects) has led to what the author suggests to call pluriformalizations, i.e. formalizations that are based on distinct sub-models which are expressed in a variety of heterogeneous symbolic languages. With the help of four case-studies, he shows that such pluriformalizations enable to formalize distinctly but simultaneously either different aspects (...) or different parts or different scales of the same object or system. From an epistemological standpoint, he suggests that this kind of computer-aided complex formalization of composite objects renew the traditional relations between computer simulations, theoretical models and operational models. (shrink)

In this paper, we bring together research on complex problem solving with that on motivational psychology about goal setting. Complex problems require motivational effort because of their inherent difficulties. Goal Setting Theory has shown with simple tasks that high, specific performance goals lead to better performance outcome than do-your-best goals. However, in complex tasks, learning goals have proven more effective than performance goals. Based on the Zurich Resource Model, so-called motto-goals should activate a person’s resources through positive affect. It (...) was found that motto-goals are effective with unpleasant duties. Therefore, we tested the hypothesis that motto-goals outperform learning and performance goals in the case of complex problems. A total of N = 123 subject participated in the experiment. In dependence of their goal condition, subjects developed a personal motto, learning, or performance goal. This goal was adapted for the computer-simulated complex scenario Tailorshop, where subjects worked as managers in a small fictional company. Other than expected, there was no main effect of goal condition for the management performance. An unexpected gender effect revealed better performance for men than women, pointing to a potential stereotype threat. As hypothesized, motto goals led to higher positive and lower negative affect than the other two goal types. Even though positive affect decreased and negative affect increased in all three groups during Tailorshop completion, participants with motto goals reported the lowest rates of negative affect. Exploratory analyses investigated the role of affect in complex problem solving via mediational analyses and the influence of goal type on perceived goal attainment. (shrink)

Simulation models of the Reiterated Prisoner's Dilemma have been popular for studying the evolution of cooperation since more than 30 years now. However, there have been practically no successful instances of empirical application of any of these models. At the same time this lack of empirical testing and confirmation has almost entirely been ignored by the modelers community. In this paper, I examine some of the typical narratives and standard arguments with which these models are justified by their authors (...) despite the lack of empirical validation. I find that most of the narratives and arguments are not at all compelling. None the less they seem to serve an important function in keeping the simulation business running despite its empirical shortcomings. (shrink)

Scientists depend on complex computational systems that are often ineliminably opaque, to the detriment of our ability to give scientific explanations and detect artifacts. Some philosophers have s...

Abstract: In the future, it will be possible to create advance simulations of ancestor in computers. Superintelligent AI could make these simulations very similar to the real past by creating a simulation of all of humanity. Such a simulation would use all available data about the past, including internet archives, DNA samples, advanced nanotech-based archeology, human memories, as well as text, photos and videos. This means that currently living people will be recreated in such a simulation, and (...) in some sense, “resurrected”. Such “resurrectional simulation” could be deliberately created just for this goal: to return to life all people who have ever lived. The main technical problem of such simulation will be uncertainty about the past, which increases exponentially for more remote times. Such problem could be partly addressed by “acausal trade” between different branches of the multiverse, which will create slightly different versions of the simulation using a quantum randomness generator. Such trade will result in resurrection of all possible people (including those who existed in other branches). Ethical problems of such a resurrectional simulation include: a) possible resurrection of some people against their will; b) such simulation may create additional suffering; с) such simulation could be used by hostile AI to return people to life and then torture them. In this work, I explore preliminary ideas about how to address these problems. (shrink)

The credibility of digital computer simulations has always been a problem. Today, through the debate on verification and validation, it has become a key issue. I will review the existing theses on that question. I will show that, due to the role of epistemological beliefs in science, no general agreement can be found on this matter. Hence, the complexity of the construction of sciences must be acknowledged. I illustrate these claims with a recent historical example. Finally I temperate this (...) diversity by insisting on recent trends in environmental sciences and in industrial sciences. (shrink)

I discuss here the definition of computer simulations, and more specifically the views of Humphreys, who considers that an object is simulated when a computer provides a solution to a computational model, which in turn represents the object of interest. I argue that Humphreys's concepts are not able to analyse fully successfully a case of contemporary simulation in physics, which is more complex than the examples considered so far in the philosophical literature. I therefore modify Humphreys's definition (...) of simulation. I allow for several successive layers of computational models, and I discuss the relations that exist between these models, the computer, and the object under study. An aim of my proposal is to clarify the distinction between computational models and numerical methods, and to better understand the representational and the computational functions of models in simulations. (shrink)

This paper explores the epistemological challenges in using computer simulations for two distinct goals: explanation via hypothesis-testing and prediction. It argues that each goal requires different strategies for justifying inferences drawn from simulation results due to different practical and conceptual constraints. The paper identifies unique and shared strategies researchers employ to increase confidence in their inferences for each goal. For explanation via hypothesis-testing, researchers need to address the underdetermination, interpretability, and attribution challenges. In prediction, the emphasis is on (...) the model's ability to generalize across multiple domains. Shared strategies researchers employ to increase confidence in inferences are empirical corroboration of theoretical assumptions and adequacy of computational operationalizations, and this paper argues that these are necessary for explanation via hypothesis-testing but not for prediction. This paper emphasizes the need for a nuanced approach to the epistemology of computer simulation, given the diverse applications of computer simulation in scientific research. Understanding these differences is crucial for both researchers and philosophers of science, as it helps develop appropriate methodologies and criteria for assessing the trustworthiness of computer simulation. (shrink)

A series of representations must be semantics-driven if the members of that series are to combine into a single thought: where semantics is not operative, there is at most a series of disjoint representations that add up to nothing true or false, and therefore do not constitute a thought at all. A consequence is that there is necessarily a gulf between simulating thought, on the one hand, and actually thinking, on the other. A related point is that a popular doctrine (...) - the so-called 'computational theory of mind' (CTM) - is based on a confusion. CTM is the view that thought-processes consist in 'computations', where a computation is defined as a 'form-driven' operation on symbols. The expression 'form-driven operation' is ambiguous, as it may refer either to syntax-driven operations or to morphology-driven operations. Syntax-driven operations presuppose the existence of operations that are driven by semantic and extra-semantic knowledge. So CTM is false if the terms 'computation' and 'form-driven operation' are taken to refer to syntax-driven operations. Thus, if CTM is to work, those expressions must be taken to refer to morphology-driven operations. CTM therefore fails, given that an operation must be semantics-driven if it is to qualify as a thought. CTM therefore fails on each possible disambiguation of the expressions 'formal operation' and 'computation,' and it is therefore false. (shrink)

For computer simulation models to usefully inform climate risk management, uncertainties in model projections must be explored and characterized. Because doing so requires running the model many ti...

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second (...) recursion theorem, I prove that it is mathematically possible for us to be in a simulation that is being run on a computer \textit{by us}. In such a case, there would be two identical instances of us; the question of which of those is ``really us'' is meaningless. I also show how Rice's theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; briefly investigate the graphical structure of universes simulating universes simulating universes, among other issues. I end by describing some of the possible avenues for future research that this preliminary investigation reveals. (shrink)

There is an ongoing debate on whether or to what degree computer simulations can be likened to experiments. Many philosophers are sceptical whether a strict separation between the two categories is possible and deny that the materiality of experiments makes a difference (Morrison 2009, Parker 2009, Winsberg 2010). Some also like to describe computer simulations as a “third way” between experimental and theoretical research (Rohrlich 1990, Axelrod 2003, Kueppers/Lenhard 2005). In this article I defend the view that (...) class='Hi'>computer simulations are not experiments but that they are tools for evaluating the consequences of theories and theoretical assumptions. In order to do so the (alleged) similarities and differences between simulations and experiments are examined. It is found that three fundamental differences between simulations and experiments remain: 1) Only experiments can generate new empirical data. 2) Only Experiments can operate directly on the target system. 3) Experiments alone can be employed for testing fundamental hypotheses. As a consequence, experiments enjoy a distinct epistemic role in science that cannot completely be superseded by computer simulations. This finding in connection with a discussion of border cases such as hybrid methods that combine measurement with simulation shows that computer simulations can clearly be distinguished from empirical methods. It is important to understand that computer simulations are not experiments, because otherwise there is a danger of systematically underestimating the need for empirical validation of simulations. (shrink)

In this paper we investigate with a case study from chemistry under what conditions a simulation can serve as a surrogate for an experiment. The case-study concerns a simulation of H2-formation in outer space. We find that in this case the simulation can act as a surrogate for an experiment, because there exists comprehensive theoretical background knowledge in form of quantum mechanics about the range of phenomena to which the investigated process belongs and because any particular modelling (...) assumptions as can be justified. If these requirements are met then direct empirical validation may even be dispensable. We conjecture that this is not the case in the absence of comprehensive theoretical background knowledge. (shrink)

Mathematical models are a well established tool in most natural sciences. Although models have been neglected by the philosophy of science for a long time, their epistemological status as a link between theory and reality is now fairly well understood. However, regarding the epistemological status of mathematical models in the social sciences, there still exists a considerable unclarity. In my paper I argue that this results from specific challenges that mathematical models and especially computer simulations face in the social (...) sciences. The most important difference between the social sciences and the natural sciences with respect to modeling is that in the social sciences powerful and well confirmed background theories (like Newtonian mechanics, quantum mechanics or the theory of relativity in physics) do not exist in the social sciences. Therefore, an epistemology of models that is formed on the role model of physics may not be appropriate for the social sciences. I discuss the challenges that modeling faces in the social sciences and point out their epistemological consequences. The most important consequences are that greater emphasis must be placed on empirical validation than on theoretical validation and that the relevance of purely theoretical simulations is strongly limited. (shrink)

This paper is intended as a critical examination of the question of when and under what conditions the use of computer simulations is beneficial to scientific explanations. This objective is pursued in two steps: First, I try to establish clear criteria that simulations must meet in order to be explanatory. Basically, a simulation has explanatory power only if it includes all causally relevant factors of a given empirical configuration and if the simulation delivers stable results within the (...) measurement inaccuracies of the input parameters. -/- In the second step, I examine a few examples of Axelrod-style simulations as they have been used to understand the evolution of cooperation (Axelrod, Schüßler). These simulations do not meet the criteria for explanatory validity and it can be shown, as I believe, that they lead us astray from the scientific problems they have been addressed to solve. (shrink)

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (shrink)

The paper develops a positive account of the representational capacity of cognitive systems: simple, associationist learning mechanisms and an architecture that supports bootstrapping are sufficient conditions for symbol tool use. In terms of the debates within the philosophy of mind, this paper offers a plausibility account of representation externalism, an alternative to the reductive, computational/representational models of intentionality that still play a leading role in the field. Although the central theme here is representation, methodologically this view complements embodied, (...) enactivist approaches to studying cognition. (shrink)

Scientists and engineers seek to understand how real-world systems work and could work better. Any modeling method devised for such purposes must simplify reality. Ideally, however, the modeling method should be flexible as well as logically rigorous; it should permit model simplifications to be appropriately tailored for the specific purpose at hand. Flexibility and logical rigor have been the two key goals motivating the development of Agent-based Computational Economics (ACE), a completely agent-based modeling method characterized by seven specific modeling principles. (...) This perspective provides an overview of ACE, a brief history of its development, and its role within a broader spectrum of experiment-based modeling methods. (shrink)

This article aims to develop a new account of scientific explanation for computer simulations. To this end, two questions are answered: what is the explanatory relation for computer simulations? And what kind of epistemic gain should be expected? For several reasons tailored to the benefits and needs of computer simulations, these questions are better answered within the unificationist model of scientific explanation. Unlike previous efforts in the literature, I submit that the explanatory relation is between the (...) class='Hi'>simulation model and the results of the simulation. I also argue that our epistemic gain goes beyond the unificationist account, encompassing a practical dimension as well. (shrink)

Endowing artificial systems with explanatory capacities about the reasons guiding their decisions, represents a crucial challenge and research objective in the current fields of Artificial Intelligence (AI) and Computational Cognitive Science [Langley et al., 2017]. Current mainstream AI systems, in fact, despite the enormous progresses reached in specific tasks, mostly fail to provide a transparent account of the reasons determining their behavior (both in cases of a successful or unsuccessful output). This is due to the fact that the classical problem (...) of opacity in artificial neural networks (ANNs) explodes with the adoption of current Deep Learning techniques [LeCun, Bengio, Hinton, 2015]. In this paper we argue that the explanatory deficit of such techniques represents an important problem, that limits their adoption in the cognitive modelling and computational cognitive science arena. In particular we will show how the current attempts of providing explanations of the deep nets behaviour (see e.g. [Ritter et al. 2017] are not satisfactory. As a possibile way out to this problem, we present two different research strategies. The first strategy aims at dealing with the opacity problem by providing a more abstract interpretation of neural mechanisms and representations. This approach is adopted, for example, by the biologically inspired SPAUN architecture [Eliasmith et al., 2012] and by other proposals suggesting, for example, the interpretation of neural networks in terms of the Conceptual Spaces framework [Gärdenfors 2000, Lieto, Chella and Frixione, 2017]. All such proposals presuppose that the neural level of representation can be considered somehow irrelevant for attacking the problem of explanation [Lieto, Lebiere and Oltramari, 2017]. In our opinion, pursuing this research direction can still preserve the use of deep learning techniques in artificial cognitive models provided that novel and additional results in terms of “transparency” are obtained. The second strategy is somehow at odds with respect to the previous one and tries to address the explanatory issue by avoiding to directly solve the “opacity” problem. In this case, the idea is that one of resorting to pre-compiled plausible explanatory models of the word used in combination with deep-nets (see e.g. [Augello et al. 2017]). We argue that this research agenda, even if does not directly fits the explanatory needs of Computational Cognitive Science, can still be useful to provide results in the area of applied AI aiming at shedding light on the models of interaction between low level and high level tasks (e.g. between perceptual categorization and explanantion) in artificial systems. (shrink)

The paper analyses in some depth the distinction by Paul Humphreys between "epistemic opacity" —which I refer to as "weak epistemic opacity" here— and "essential epistemic opacity", and defends the idea that epistemic opacity in general can be made sense as coming in degrees. The idea of degrees of epistemic opacity is then exploited to show, in the context of computer simulations, the tight relation between the concept of epistemic opacity and actual scientific (modelling and simulation) practices. As (...) a consequence, interesting questions arise in connection with the role of agents dealing with epistemically opaque processes such as computer simulations. (shrink)

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set is finite. (...) But then, given fundamental results in recursion theory, the set will also be recursive, recursively enumerable, axiomatizable, and could be the output of a Turing machine. We then argue that it is impossible to produce a string of symbols that humans could possibly produce but no Turing machine could. Moreover, we show that any given string of symbols that we could produce could also be the output of a Turing machine. Our arguments have implications for Hilbert’s sixth problem and the possibility of axiomatizing particular sciences, they undermine at least two distinct arguments against the possibility of Artificial Intelligence, and they entail that expert systems that are the equals of human experts are possible, and so at least one of the goals of Artificial Intelligence can be realized, at least in principle. (shrink)

Computer simulations constitute a significant scientific tool for promoting scientific understanding of natural phenomena and dynamic processes. Substantial leaps in computational force and software engineering methodologies now allow the design and development of large-scale biological models, which – when combined with advanced graphics tools – may produce realistic biological scenarios, that reveal new scientific explanations and knowledge about real life phenomena. A state-of-the-art simulation system termed Reactive Animation (RA) will serve as a study case to examine the contemporary (...) philosophical debate on the scientific value of simulations, as we demonstrate its ability to form a scientific explanation of natural phenomena and to generate new emergent behaviors, making possible a prediction or hypothesis about the equivalent real-life phenomena. (shrink)

Although formal thought disorder (FTD) has been for long a clinical label in the assessment of some psychiatric disorders, in particular of schizophrenia, it remains a source of controversy, mostly because it is hard to say what exactly the “formal” in FTD refers to. We see anomalous processing of terminological knowledge, a core construct of human knowledge in general, behind FTD symptoms and we approach this anomaly from a strictly formal perspective. More specifically, we present here a symbolic computational model (...) of storage in, and activation of, a human semantic network, or semantic memory, whose core element is logical form; this is normalized by description logic (DL), namely by CL, a DL-based language – Conception Language – designed to formalize conceptualization from the viewpoint of individual cognitive agency. In this model, disruptions in the rule-based implementation of the logical form account for the apparently semantic anomalies symptomatic of FTD, which are detected by means of a CL-based algorithmic assessment. (shrink)

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The (...) new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given. (shrink)

Counterfactual thinking involves the imagination of non-factual alternatives to reality. We investigated the spontaneous generation of both upward counterfactuals, which improve on reality, and downward counterfactuals, which worsen reality. All subjects gained $5 playing a computer-simulated blackjack game. However, this outcome was framed to be perceived as either a win, a neutral event, or a loss. "Loss" frames produced more upward and fewer downward counterfactuals than did either "win" or "neutral" frames, but the overall prevalence of counterfactual thinking did (...) not vary with outcome valence. In addition, subjects who expected to play the game again made more upward counterfactuals and were less satisfied with the outcome than were subjects who did not expect to play again. However, once subjects saw the cards from which they could have selected had they "hit" again (two winning cards and two losing cards), all subjects generated primarily upward counterfactuals and showed a corresponding decrease in satisfaction. These results implicate both cognitive and motivational factors in the generation of counterfactuals and tell us something about the functional value of counterfactual thinking: downward counterfactuals provide comfort; upward counterfactuals prepare one for the future. (shrink)

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we (...) provide an overview of the Google Quantum Team’s experiments, then identify some open questions in the quest to demonstrate quantum supremacy. (shrink)

With the rapidly growing amounts of information, visualization is becoming increasingly important, as it allows users to easily explore and understand large amounts of information. However the field of information visualiza- tion currently lacks sufficient theoretical foundations. This article addresses foundational questions connecting information visualization with computing and philosophy studies. The idea of multiscale information granula- tion is described based on two fundamental concepts: information (structure) and computation (process). A new information processing paradigm of Granular Computing enables stepwise increase of (...) granulation/aggregation of information on different levels of resolution, which makes possible dynamical viewing of data. Information produced by Google Earth is an illustration of visualization based on clustering (granulation) of information on a succession of layers. Depending on level, specific emergent properties become visible as a result of different ways of aggregation of data/information. As information visualization ultimately aims at amplifying cognition, we discuss the process of simulation and emulation in relation to cognition, and in particular visual cognition. (shrink)

Nick Bostrom considered a number of simulations and contended that the probability that we are living in one of them is high or at least nonzero. I present arguments to refute the claim that we are or might be in any one of them. -/- Here is a highly dense reasoning why we are not in the simulation: -/- Suppose Simon is in the simulation, and he entertains the idea that he is in the simulation. And he (...) thinks about the word 'apple'. But since he is always in the simulation, he has never interacted with an actual apple, which the word 'apple' refers to. -/- Then Simon must think that "if I am in the simulation, then I never interact with an actual apple, and my understanding about the word 'apple' can only be given by the simulator. And this means I never exercise my reason to gain the understanding about the word 'apple', and never exercise my reason to apply the word 'apple'. Consequently, since what I am thinking right now (namely, this entire thought within the double quotation marks) involves the word 'apple', I am not using reason to think what I am thinking." -/- By denying he is using reason to think, Simon is being incoherent in thinking the preceding thought. To avoid being incoherent, Simon must reject the idea that he is in the simulation. -/- For the similar reason, if we think we are in the simulation, we are being incoherent. More simply, to think that we are in the simulation is to be incoherent. Therefore we cannot actually think that we are in the simulation. Hence, we are not in the simulation. -/- The whole paper is to flesh out the reasoning above. (shrink)

Modularity theorists have challenged that there are, or could be, general learning mechanisms that explain theory-of-mind development. In response, supporters of the ‘scientific theory-theory’ account of theory-of-mind development have appealed to children's use of auxiliary hypotheses and probabilistic causal modeling. This article argues that these general learning mechanisms are not sufficient to meet the modularist's challenge. The article then explores an alternative domain-general learning mechanism by proposing that children grasp the concept belief through the progressive alignment of (...) relational structure that occurs as a result of structural-comparison. The article also explores the implications of the proposed account for Fodor's puzzle of conceptual learning. (shrink)

The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to (...) symbol grounding. In this case, no symbol grounding could take place since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or over meaningful symbols, computationalism implies semantic nativism. (shrink)

This book is an edited collection of original research papers on the digital revolution of the public and governance. It covers cyber governance in Finland, and the securitization of cyber security in Finland. It investigates the cases of Brexit, the 2016 US presidential election of Donald Trump, the 2017 presidential election of Volodymyr Zelensky, and Brexit. It examines the environmental concerns of climate change and greenwashing, and the impact of digital communication giving rise to the #MeToo and Incel movements. It (...) considers how digitilization can serve to emancipate women through ride-sharing, and how it leads to the question of robot rights. It considers fake news and algorithmic governance with respect to case studies of the Chinese social credit system, the US FICO credit score, along with Facebook, Twitter, Cambridge Analytica and the European effort to regulate and protect data usage. (shrink)