Results for 'computational irreducibility'

999 found
Order:
  1. Computation and Multiple Realizability.Marcin Miłkowski - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 29-41.
    Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  2. Evolution: The Computer Systems Engineer Designing Minds.Aaron Sloman - 2011 - Avant: Trends in Interdisciplinary Studies 2 (2):45-69.
    What we have learnt in the last six or seven decades about virtual machinery, as a result of a great deal of science and technology, enables us to offer Darwin a new defence against critics who argued that only physical form, not mental capabilities and consciousness could be products of evolution by natural selection. The defence compares the mental phenomena mentioned by Darwin’s opponents with contents of virtual machinery in computing systems. Objects, states, events, and processes in virtual machinery which (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. Towards a Theory of Computation similar to some other scientific theories.Antonino Drago - manuscript
    At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is like many (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. The problem of AI identity.Soenke Ziesche & Roman V. Yampolskiy - manuscript
    The problem of personal identity is a longstanding philosophical topic albeit without final consensus. In this article the somewhat similar problem of AI identity is discussed, which has not gained much traction yet, although this investigation is increasingly relevant for different fields, such as ownership issues, personhood of AI, AI welfare, brain–machine interfaces, the distinction between singletons and multi-agent systems as well as to potentially support finding a solution to the problem of personal identity. The AI identity problem analyses the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. God is Random: A Novel Argument for the Existence of God.Serkan Zorba - 2016 - European Journal of Science and Theology 12 (1):51-67.
    Applying the concepts of Kolmogorov-Chaitin complexity and Turing’s uncomputability from the computability and algorithmic information theories to the irreducible and incomputable randomness of quantum mechanics, a novel argument for the existence of God is presented. Concepts of ‘transintelligence’ and ‘transcausality’ are introduced, and from them, it is posited that our universe must be epistemologically and ontologically an open universe. The proposed idea also proffers a new perspective on the nonlocal nature and the infamous wave-function-collapse problem of quantum mechanics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Alife models as epistemic artefacts.Xabier Barandiaran & Alvaro Moreno - 2006 - In Luis Rocha, Larry Yaeger & Mark Bedau (eds.), Artificial Life X : Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems. MIT Press. pp. 513-519.
    Both the irreducible complexity of biological phenomena and the aim of a universalized biology (life-as-it-could-be) have lead to a deep methodological shift in the study of life; represented by the appearance of ALife, with its claim that computational modelling is the main tool for studying the general principles of biological phenomenology. However this methodological shift implies important questions concerning the aesthetic, engineering and specially the epistemological status of computational models in scientific research: halfway between the well established categories (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  7. Why Machine-Information Metaphors are Bad for Science and Science Education.Massimo Pigliucci & Maarten Boudry - 2011 - Science & Education 20 (5-6):471.
    Genes are often described by biologists using metaphors derived from computa- tional science: they are thought of as carriers of information, as being the equivalent of ‘‘blueprints’’ for the construction of organisms. Likewise, cells are often characterized as ‘‘factories’’ and organisms themselves become analogous to machines. Accordingly, when the human genome project was initially announced, the promise was that we would soon know how a human being is made, just as we know how to make airplanes and buildings. Impor- tantly, (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  8. Classical AI linguistic understanding and the insoluble Cartesian problem.Rodrigo González - 2020 - AI and Society 35 (2):441-450.
    This paper examines an insoluble Cartesian problem for classical AI, namely, how linguistic understanding involves knowledge and awareness of u’s meaning, a cognitive process that is irreducible to algorithms. As analyzed, Descartes’ view about reason and intelligence has paradoxically encouraged certain classical AI researchers to suppose that linguistic understanding suffices for machine intelligence. Several advocates of the Turing Test, for example, assume that linguistic understanding only comprises computational processes which can be recursively decomposed into algorithmic mechanisms. Against this background, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. On the Solvability of the Mind-Body Problem.Jan Scheffel - manuscript
    The mind-body problem is analyzed in a physicalist perspective. By combining the concepts of emergence and algorithmic information theory in a thought experiment employing a basic nonlinear process, it is shown that epistemically strongly emergent properties may develop in a physical system. Turning to the significantly more complex neural network of the brain it is subsequently argued that consciousness is epistemically emergent. Thus reductionist understanding of consciousness appears not possible; the mind-body problem does not have a reductionist solution. The ontologically (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  10. Realism in Mind.Ricardo Restrepo - 2010 - University of Canterbury, New Zealand.
    The thesis develops solutions to two main problems for mental realism. Mental realism is the theory that mental properties, events, and objects exist, with their own set of characters and causal powers. The first problem comes from the philosophy of science, where Psillos proposes a notion of scientific realism that contradicts mental realism, and consequently, if one is to be a scientific realist in the way Psillos recommends, one must reject mental realism. I propose adaptations to the conception of scientific (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11.  12
    Criticism of individualist and collectivist methodological approaches to social emergence.S. M. Reza Amiri Tehrani - 2023 - Expositions: Interdisciplinary Studies in the Humanities 15 (3):111-139.
    ABSTRACT The individual-community relationship has always been one of the most fundamental topics of social sciences. In sociology, this is known as the micro-macro relationship while in economics it refers to the processes, through which, individual actions lead to macroeconomic phenomena. Based on philosophical discourse and systems theory, many sociologists even use the term "emergence" in their understanding of micro-macro relationship, which refers to collective phenomena that are created by the cooperation of individuals, but cannot be reduced to individual actions. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. The unsolvability of the mind-body problem liberates the will.Scheffel Jan - manuscript
    The mind-body problem is analyzed in a physicalist perspective. By combining the concepts of emergence and algorithmic information theory in a thought experiment employing a basic nonlinear process, it is argued that epistemically strongly emergent properties may develop in a physical system. A comparison with the significantly more complex neural network of the brain shows that also consciousness is epistemically emergent in a strong sense. Thus reductionist understanding of consciousness appears not possible; the mind-body problem does not have a reductionist (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. Using Computer-Assisted Argument Mapping to Teach Reasoning to Students.Martin Davies, Ashley Barnett & Tim van Gelder - 2021 - In J. Anthony Blair (ed.), The Critical Thinking Anthology. pp. 115-152.
    Argument mapping is a way of diagramming the logical structure of an argument to explicitly and concisely represent reasoning. The use of argument mapping in critical thinking instruction has increased dramatically in recent decades. This paper overviews the innovation and provides a procedural approach for new teaches wanting to use argument mapping in the classroom. A brief history of argument mapping is provided at the end of this paper.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  14. The Irreducibility of Emotional Phenomenology.Jonathan Mitchell - 2020 - Erkenntnis 85.
    Emotion theory includes attempts to reduce or assimilate emotions to states such as bodily feelings, beliefs-desire combinations, and evaluative judgements. Resistance to such approaches is motivated by the claim that emotions possess a sui generis phenomenology. Uriah Kriegel defends a new form of emotion reductivism which avoids positing irreducible emotional phenomenology by specifying emotions’ phenomenal character in terms of a combination of other phenomenologies. This article argues Kriegel’s approach, and similar proposals, are unsuccessful, since typical emotional experiences are constituted by (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  15. Computing Mechanisms and Autopoietic Systems.Joe Dewhurst - 2016 - In Vincent C. Müller (ed.), Computing and philosophy: Selected papers from IACAP 2014. Cham: Springer. pp. 17-26.
    This chapter draws an analogy between computing mechanisms and autopoietic systems, focusing on the non-representational status of both kinds of system (computational and autopoietic). It will be argued that the role played by input and output components in a computing mechanism closely resembles the relationship between an autopoietic system and its environment, and in this sense differs from the classical understanding of inputs and outputs. The analogy helps to make sense of why we should think of computing mechanisms as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Irreducible Cognitive Phenomenology and the AHA! Experience.John Joseph Dorsch - 2016 - Phenomenology and Mind 10:108-121.
    Elijah Chudnoff’s case for irreducible cognitive phenomenology hinges on seeming to see the truth of a mathematical proposition (Chudnoff 2015). In the following, I develop an augmented version of Chudnoff’s case, not based on seeming to see, or intuition, but based on being in a state with presentational phenomenology of high-level content. In contrast to other cases for cognitive phenomenology, those based on Strawson’s case (Strawson 2011), I argue that the case presented here is able to withstand counterarguments, which attempt (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  17. Agent-Based Computational Economics: A Constructive Approach to Economic Theory.Leigh Tesfatsion - 2006 - In Leigh Tesfatsion & Kenneth L. Judd (eds.), Handbook of Computational Economics, Volume 2: Agent-Based Computational Economics. Amsterdam, The Netherlands: Elsevier.
    Economies are complicated systems encompassing micro behaviors, interaction patterns, and global regularities. Whether partial or general in scope, studies of economic systems must consider how to handle difficult real-world aspects such as asymmetric information, imperfect competition, strategic interaction, collective learning, and the possibility of multiple equilibria. Recent advances in analytical and computational tools are permitting new approaches to the quantitative study of these aspects. One such approach is Agent-based Computational Economics (ACE), the computational study of economic processes (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  18. Information, Computation, Cognition. Agency-Based Hierarchies of Levels.Gordana Dodig-Crnkovic - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 139-159.
    This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Computer Simulations in Science and Engineering. Concept, Practices, Perspectives.Juan Manuel Durán - 2018 - Springer.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  20. The Irreducibility of Iterated to Single Revision.Jake Chandler & Richard Booth - 2017 - Journal of Philosophical Logic 46 (4):405-418.
    After a number of decades of research into the dynamics of rational belief, the belief revision theory community remains split on the appropriate handling of sequences of changes in view, the issue of so-called iterated revision. It has long been suggested that the matter is at least partly settled by facts pertaining to the results of various single revisions of one’s initial state of belief. Recent work has pushed this thesis further, offering various strong principles that ultimately result in a (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  84
    Computers Are Syntax All the Way Down: Reply to Bozşahin.William J. Rapaport - 2019 - Minds and Machines 29 (2):227-237.
    A response to a recent critique by Cem Bozşahin of the theory of syntactic semantics as it applies to Helen Keller, and some applications of the theory to the philosophy of computer science.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Handbook of Computational Economics, Volume 2: Agent-Based Computational Economics.Leigh Tesfatsion & Kenneth L. Judd (eds.) - 2006 - Amsterdam, The Netherlands: Elsevier.
    The explosive growth in computational power over the past several decades offers new tools and opportunities for economists. This handbook volume surveys recent research on Agent-based Computational Economics (ACE), the computational study of economic processes modeled as open-ended dynamic systems of interacting agents. Empirical referents for “agents” in ACE models can range from individuals or social groups with learning capabilities to physical world features with no cognitive function. Topics covered include: learning; empirical validation; network economics; social dynamics; (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  23. Two irreducible classes of emotional experiences: Affective imaginings and affective perceptions.Jonathan Mitchell - 2021 - European Journal of Philosophy 30 (1):307-325.
    European Journal of Philosophy, Volume 30, Issue 1, Page 307-325, March 2022.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Irreducible Aspects of Embodiment: Situating Scientist and Subject.Nick Brancazio - 2018 - Australasian Philosophical Review 2 (2):219-223.
    Feminist philosophers of science have long discussed the importance of taking situatedness into account in scientific practices to avoid erasing important aspects of lived experience. Through the example of Gillian Einstein’s [2012] situated neuroscience, I will add support to Gallagher’s [2019] claims that intertheoretic reduction is problematic and provide reason to think pluralistic methodologies are explanatorily and ethically preferable.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  25. Computation of higher order Lie derivatives on the Infinity Computer.Felice Iavernaro, Francesca Mazzia, Marat Mukhametzhanov & Yaroslav Sergeyev - 2021 - Journal of Computational and Applied Mathematics 383:113135.
    In this paper, we deal with the computation of Lie derivatives, which are required, for example, in some numerical methods for the solution of differential equations. One common way for computing them is to use symbolic computation. Computer algebra software, however, might fail if the function is complicated, and cannot be even performed if an explicit formulation of the function is not available, but we have only an algorithm for its computation. An alternative way to address the problem is to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  26. Computation in Physical Systems: A Normative Mapping Account.Paul Schweizer - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag. pp. 27-47.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  27. Irreducibly collective existence and bottomless nihilism.Jonas Werner - 2022 - Synthese 200 (2):1-16.
    This paper develops the metaphysical hypothesis that there are irreducibly collective pluralities, pluralities of objects that do not have a singular object among them. A way to formulate this hypothesis using plural quantification will be proposed and the coherence of irreducibly collective existence will be defended. Furthermore, irreducibly collective existence will be shown to allow for bottomless scenarios that do not involve things standing in relations of parthood. This will create logical space for an anti-atomistic form of mereological nihilism.
    Download  
     
    Export citation  
     
    Bookmark  
  28. Cognitive Computation sans Representation.Paul Schweizer - 2017 - In Thomas Powers (ed.), Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics,. Cham, Switzerland: Springer. pp. 65-84.
    The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  29. The computational and the representational language-of-thought hypotheses.David J. Chalmers - 2023 - Behavioral and Brain Sciences 46:e269.
    There are two versions of the language-of-thought hypothesis (LOT): Representational LOT (roughly, structured representation), introduced by Ockham, and computational LOT (roughly, symbolic computation) introduced by Fodor. Like many others, I oppose the latter but not the former. Quilty-Dunn et al. defend representational LOT, but they do not defend the strong computational LOT thesis central to the classical-connectionist debate.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Learning Computer Networks Using Intelligent Tutoring System.Mones M. Al-Hanjori, Mohammed Z. Shaath & Samy S. Abu Naser - 2017 - International Journal of Advanced Research and Development 2 (1).
    Intelligent Tutoring Systems (ITS) has a wide influence on the exchange rate, education, health, training, and educational programs. In this paper we describe an intelligent tutoring system that helps student study computer networks. The current ITS provides intelligent presentation of educational content appropriate for students, such as the degree of knowledge, the desired level of detail, assessment, student level, and familiarity with the subject. Our Intelligent tutoring system was developed using ITSB authoring tool for building ITS. A preliminary evaluation of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  31. Computing and philosophy: Selected papers from IACAP 2014.Vincent C. Müller (ed.) - 2016 - Cham: Springer.
    This volume offers very selected papers from the 2014 conference of the “International Association for Computing and Philosophy” (IACAP) - a conference tradition of 28 years. - - - Table of Contents - 0 Vincent C. Müller: - Editorial - 1) Philosophy of computing - 1 Çem Bozsahin: - What is a computational constraint? - 2 Joe Dewhurst: - Computing Mechanisms and Autopoietic Systems - 3 Vincenzo Fano, Pierluigi Graziani, Roberto Macrelli and Gino Tarozzi: - Are Gandy Machines really (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Mechanistic Computational Individuation without Biting the Bullet.Nir Fresco & Marcin Miłkowski - 2019 - British Journal for the Philosophy of Science:axz005.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  33. Computability, Notation, and de re Knowledge of Numbers.Stewart Shapiro, Eric Snyder & Richard Samuels - 2022 - Philosophies 1 (7).
    Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship between (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34.  7
    Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. From Computer Metaphor to Computational Modeling: The Evolution of Computationalism.Marcin Miłkowski - 2018 - Minds and Machines 28 (3):515-541.
    In this paper, I argue that computationalism is a progressive research tradition. Its metaphysical assumptions are that nervous systems are computational, and that information processing is necessary for cognition to occur. First, the primary reasons why information processing should explain cognition are reviewed. Then I argue that early formulations of these reasons are outdated. However, by relying on the mechanistic account of physical computation, they can be recast in a compelling way. Next, I contrast two computational models of (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  36. Computer simulation and the features of novel empirical data.Greg Lusk - 2016 - Studies in History and Philosophy of Science Part A 56:145-152.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  37. Computational entrepreneurship: from economic complexities to interdisciplinary research.Quan-Hoang Vuong - 2019 - Problems and Perspectives in Management 17 (1):117-129.
    The development of technology is unbelievably rapid. From limited local networks to high speed Internet, from crude computing machines to powerful semi-conductors, the world had changed drastically compared to just a few decades ago. In the constantly renewing process of adapting to such an unnaturally high-entropy setting, innovations as well as entirely new concepts, were often born. In the business world, one such phenomenon was the creation of a new type of entrepreneurship. This paper proposes a new academic discipline of (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  38. Computational modeling in philosophy: introduction to a topical collection.Simon Scheller, Christoph Merdes & Stephan Hartmann - 2022 - Synthese 200 (2):1-10.
    Computational modeling should play a central role in philosophy. In this introduction to our topical collection, we propose a small topology of computational modeling in philosophy in general, and show how the various contributions to our topical collection fit into this overall picture. On this basis, we describe some of the ways in which computational models from other disciplines have found their way into philosophy, and how the principles one found here still underlie current trends in the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Computer-assisted argument mapping: A Rationale Approach.Martin Davies - 2009 - Higher Education 58:799-820.
    Computer-Assisted Argument Mapping (CAAM) is a new way of understanding arguments. While still embryonic in its development and application, CAAM is being used increasingly as a training and development tool in the professions and government. Inroads are also being made in its application within education. CAAM claims to be helpful in an educational context, as a tool for students in responding to assessment tasks. However, to date there is little evidence from students that this is the case. This paper outlines (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  40. Computing in the nick of time.J. Brendan Ritchie & Colin Klein - 2023 - Ratio 36 (3):169-179.
    The medium‐independence of computational descriptions has shaped common conceptions of computational explanation. So long as our goal is to explain how a system successfully carries out its computations, then we only need to describe the abstract series of operations that achieve the desired input–output mapping, however they may be implemented. It is argued that this abstract conception of computational explanation cannot be applied to so‐called real‐time computing systems, in which meeting temporal deadlines imposed by the systems with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41. Computers Aren’t Syntax All the Way Down or Content All the Way Up.Cem Bozşahin - 2018 - Minds and Machines 28 (3):543-567.
    This paper argues that the idea of a computer is unique. Calculators and analog computers are not different ideas about computers, and nature does not compute by itself. Computers, once clearly defined in all their terms and mechanisms, rather than enumerated by behavioral examples, can be more than instrumental tools in science, and more than source of analogies and taxonomies in philosophy. They can help us understand semantic content and its relation to form. This can be achieved because they have (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  42. The Irreducibility of Pleasure to Desire.Olivier Massin - 2008 - Swiss Philosophical Preprints.
    One common answer to the question of the unity of pleasures is to try to define pleasantness by appealing to a kind of mental states whose unity is less questionable. Desires have been conceived as the best candidates for this unifying role. Indeed, one way of classifying the preceding options concerning the definition of pleasantness, is to constrast conative (or motivational) theories of pleasure with non conative ones. Conative theories of pleasure are often considered as one homogeneous type of pleasure (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. Computable Rationality, NUTS, and the Nuclear Leviathan.S. M. Amadae - 2018 - In Daniel Bessner & Nicolas Guilhot (eds.), The Decisionist Imagination: Democracy, Sovereignty and Social Science in the 20th Century. New York, NY, USA:
    This paper explores how the Leviathan that projects power through nuclear arms exercises a unique nuclearized sovereignty. In the case of nuclear superpowers, this sovereignty extends to wielding the power to destroy human civilization as we know it across the globe. Nuclearized sovereignty depends on a hybrid form of power encompassing human decision-makers in a hierarchical chain of command, and all of the technical and computerized functions necessary to maintain command and control at every moment of the sovereign's existence: this (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  44. Computational Mechanisms and Models of Computation.Marcin Miłkowski - 2014 - Philosophia Scientiae 18:215-228.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  45. Computational Mechanisms and Models of Computation.Marcin Miłkowski - 2014 - Philosophia Scientiae 18:215-228.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  46. Transparency in Complex Computational Systems.Kathleen A. Creel - 2020 - Philosophy of Science 87 (4):568-589.
    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...
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  47.  36
    On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. The Info-Computational Turn in Bioethics.Constantin Vică - 2018 - In Emilian Mihailov, Tenzin Wangmo, Victoria Federiuc & Bernice S. Elger (eds.), Contemporary Debates in Bioethics: European Perspectives. [Berlin]: De Gruyter Open. pp. 108-120.
    Our technological lifeworld has become an info-computational media populated by data and algorithms, an artificial environment for life and shared experiences. In this chapter, I tried to sketch three new assumptions for bioethics – it is hardly possible to substantiate ethical guidelines or an idea of normativity in an aprioristic manner; moral status is a function of data entities, not something solely human; agency is plural and thus is shared or sometimes delegated – in order to chart a proposal (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  49. Morphological Computation: Nothing but Physical Computation.Marcin Miłkowski - 2018 - Entropy 10 (20):942.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Computability and human symbolic output.Jason Megill & Tim Melvin - 2014 - Logic and Logical Philosophy 23 (4):391-401.
    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. (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 999