About this topic
Summary A crucial problem in the philosophy of computing is represented by the nature of computation. On the one hand, a computation is thought of as some representation of a formal process composed by well-defined steps, which allows to reach in a finite amount of time a given output from a given input. This is tantamount to the formulation of a mathematical or biological function or the design of an algorithm. On the other hand, a computation is inherently bound to its execution and thus to an implementation. This strongly relates to the problem of determining which physical systems can be said to implement a computation, in turn which systems can be said to be properly computational. The answer to this question can be offered by reduction to other relations (such as causation), but it triggered a widespread debate on whether it implies that almost any physical system is then by definition computational. This has been a particularly intense debate in the cognitive sciences. The duality formal-physical that affects the nature of computation is also of especially great importance in the philosophical debate on the nature of algorithms and programs, where the latter are considered physical implementations of the former.
Key works The thesis that certain human abilities cannot be considered implementation of computations is notoriously held by Dreyfus 1972 and PUTNAM 1987. This argument is even stronger in Searle 1980, where it is argued that even the interpretation of human abilites as implementation of computations is not enough for the mind. The thesis that a physical system implements a computation if the causal structure of the former reflects the formal structure of the latter is defended in Chalmers 1994. See also Piccinini 2007. A starting point for the  debate on the nature of algorithms is represented by Moschovakis 2001 and Gurevich 2012. Fetzer 1988 offers the very first critique of program verification in view of the formal-physical divide, with a large debate following.
Introductions See Piccinini 2010 for an overview of the notion of computation in physical systems, including an assessment of varieties of the physical Church-Turing thesis. 
Related categories

127 found
Order:
1 — 50 / 127
  1. added 2020-07-01
    Causal and Constitutive Relations, and the Squaring of Coleman’s Diagram: Reply to Vromen. [REVIEW]Nicolai Foss - 2010 - Erkenntnis 73 (3):385-391.
    We respond to Jack Vromen’s (this issue) critique of our discussion of the missing micro-foundations of work on routines and capabilities in economics and management research. Contrary to Vromen, we argue that (1) inter-level relations can be causal, and that inter-level causal relations may also obtain between routines and actions and interactions; (2) there are no macro-level causal mechanisms; and (3) on certain readings of the notion of routines and capabilities, these may be macro causes.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. added 2019-12-25
    Computational Theories of Conscious Experience: Between a Rock and a Hard Place.Gary Bartlett - 2012 - Erkenntnis 76 (2):195-209.
    Very plausibly, nothing can be a genuine computing system unless it meets an input-sensitivity requirement. Otherwise all sorts of objects, such as rocks or pails of water, can count as performing computations, even such as might suffice for mentality—thus threatening computationalism about the mind with panpsychism. Maudlin in J Philos 86:407–432, ( 1989 ) and Bishop ( 2002a , b ) have argued, however, that such a requirement creates difficulties for computationalism about conscious experience, putting it in conflict with the (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3. added 2019-12-06
    Schroedinger's Register: Foundational Issues and Physical Realization.Stephen Pink & Stanley Martens - manuscript
    This work-in-progress paper consists of four points which relate to the foundations and physical realization of quantum computing. The first point is that the qubit cannot be taken as the basic unit for quantum computing, because not every superposition of bit-strings of length n can be factored into a string of n-qubits. The second point is that the “No-cloning” theorem does not apply to the copying of one quantum register into another register, because the mathematical representation of this copying is (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. added 2019-12-06
    Multiple Realization, Levels and Mechanisms.Sergio Daniel Barberis - 2017 - Teorema: International Journal of Philosophy 36 (2):53-68.
    This paper focuses on the framework for the compositional relations of properties in the sciences, or "realization relations", offered by Ken Aizawa and Carl Gillett (A&G) in a series of papers, and in particular on the analysis of "multiple realizations" they build upon it. I argue that A&G's analysis of multiple realization requires an account of levels and I try to show, then, that the A&G framework is not successful under any of the extant accounts of levels. There is consequently (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. added 2019-12-06
    Species of Realization and the Free Energy Principle.Michael David Kirchhoff - 2015 - Australasian Journal of Philosophy 93 (4):706-723.
    This paper examines, for the first time, the relationship between realization relations and the free energy principle in cognitive neuroscience. I argue, firstly, that the free energy principle has ramifications for the wide versus narrow realization distinction: if the free energy principle is correct, then organismic realizers are insufficient for realizing free energy minimization. I argue, secondly, that the free energy principle has implications for synchronic realization relations, because free energy minimization is realized in dynamical agent-environment couplings embedded at multiple (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  6. added 2019-12-06
    Hardware Realization of Artificial Neural Network Based Intrusion Detection & Prevention System.Indraneel Mukhopadhyay - 2014 - JIS 5:154-165.
    In the 21st century with the exponential growth of the Internet, the vulnerability of the network which connects us is on the rise at a very fast pace. Today organizations are spending millions of dollars to protect their sensitive data from different vulnerabilities that they face every day. In this paper, a new methodology towards implementing an Intrusion Detection & Prevention System (IDPS) based on Artificial Neural Network (ANN) onto Field Programmable Gate Array (FPGA) is proposed. This system not only (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  7. added 2019-12-06
    Numbers and Numerosities: Absence of Abstract Neural Realization Doesn't Mean Non-Abstraction.Rafael E. Núñez - 2009 - Behavioral and Brain Sciences 32 (3-4):344-344.
    The neural realization of number in abstract form is implausible, but from this it doesn't follow that numbers are not abstract. Clear definitions of abstraction are needed so they can be applied homogenously to numerical and non-numerical cognition. To achieve a better understanding of the neural substrate of abstraction, productive cognition must be investigated.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  8. added 2019-12-06
    Real Realization: Dennett’s Real Patterns Versus Putnam’s Ubiquitous Automata. [REVIEW]David Joslin - 2006 - Minds and Machines 16 (1):29-41.
    Both Putnam and Searle have argued that that every abstract automaton is realized by every physical system, a claim that leads to a reductio argument against Cognitivism or Strong AI: if it is possible for a computer to be conscious by virtue of realizing some abstract automaton, then by Putnam’s theorem every physical system also realizes that automaton, and so every physical system is conscious—a conclusion few supporters of Strong AI would be willing to accept. Dennett has suggested a criterion (...)
    Remove from this list   Direct download (13 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9. added 2019-11-25
    Multiple Realizability.Ronald P. Endicott - 2005 - In D. Borchert (ed.), Encyclopedia of Philosophy, 2nd edition. Thomson Gale, Macmillan Reference.
    Multiple realizability has been at the heart of debates about whether the mind reduces to the brain, or whether the items of a special science reduce to the items of a physical science. I analyze the two central notions implied by the concept of multiple realizability: "multiplicity," otherwise known as property variability, and "realizability." Beginning with the latter, I distinguish three broad conceptual traditions. The Mathematical Tradition equates realization with a form of mapping between objects. Generally speaking, x realizes (or (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  10. added 2019-09-16
    O Trabalho na Era dos Robôs.Sandro Rinaldi Feliciano - 2018 - Dissertation, Universidade Federal Do ABC
    São duas formas distintas para o futuro do trabalhona era dos robôs. Estas formas servem tanto para as redes, quanto fora delas, e exceto pelos processos serem reais ou virtuais, os resultados são equipotentes. A primeira,forma,e mais atual, é a convivência entre maquinas e pessoas de um modomais ou menos harmonioso, cada qual com suas funções, com poucas sobreposições. A segunda é uma forma, onde os robôs fazem o trabalho da humanidade, substituindo completamente a maioria dospostos, e esta formapode tanto (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  11. added 2019-09-09
    Refounding of the Activity Concept? Towards a Federative Paradigm for Modeling and Simulation.Alexandre Muzy, Franck Varenne, Bernard P. Zeigler, Jonathan Caux, Patrick Coquillard, Luc Touraille, Dominique Prunetti, Philippe Caillou, Olivier Michel & David R. C. Hill - 2013 - Simulation - Transactions of the Society for Modeling and Simulation International 89 (2):156-177.
    Currently, the widely used notion of activity is increasingly present in computer science. However, because this notion is used in specific contexts, it becomes vague. Here, the notion of activity is scrutinized in various contexts and, accordingly, put in perspective. It is discussed through four scientific disciplines: computer science, biology, economics, and epistemology. The definition of activity usually used in simulation is extended to new qualitative and quantitative definitions. In computer science, biology and economics disciplines, the new simulation activity definition (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12. added 2019-08-17
    Nonrational Belief Paradoxes as Byzantine Failures.Ryan Miller - manuscript
    David Christensen and others argue that Dutch Strategies are more like peer disagreements than Dutch Books, and should not count against agents’ conformity to ideal rationality. I review these arguments, then show that Dutch Books, Dutch Strategies, and peer disagreements are only possible in the case of what computer scientists call Byzantine Failures—uncorrected Byzantine Faults which update arbitrary values. Yet such Byzantine Failures make agents equally vulnerable to all three kinds of epistemic inconsistencies, so there is no principled basis for (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  13. added 2019-07-27
    The Physics of Implementing Logic: Landauer's Principle and the Multiple-Computations Theorem.Meir Hemmo & Orly Shenker - 2019 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 68:90-105.
    This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas in terms of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14. added 2019-06-06
    Programming the Emergence in Morphogenetically Architected Complex Systems.Franck Varenne, Pierre Chaigneau, Jean Petitot & René Doursat - 2015 - Acta Biotheoretica 63 (3):295-308.
    Large sets of elements interacting locally and producing specific architectures reliably form a category that transcends the usual dividing line between biological and engineered systems. We propose to call them morphogenetically architected complex systems (MACS). While taking the emergence of properties seriously, the notion of MACS enables at the same time the design (or “meta-design”) of operational means that allow controlling and even, paradoxically, programming this emergence. To demonstrate our claim, we first show that among all the self-organized systems studied (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15. added 2019-06-06
    Deep and Beautiful. The Reward Prediction Error Hypothesis of Dopamine.Matteo Colombo - 2014 - Studies in History and Philosophy of Science Part C: Studies in History and Philosophy of Biological and Biomedical Sciences 45 (1):57-67.
    According to the reward-prediction error hypothesis of dopamine, the phasic activity of dopaminergic neurons in the midbrain signals a discrepancy between the predicted and currently experienced reward of a particular event. It can be claimed that this hypothesis is deep, elegant and beautiful, representing one of the largest successes of computational neuroscience. This paper examines this claim, making two contributions to existing literature. First, it draws a comprehensive historical account of the main steps that led to the formulation and subsequent (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  16. added 2019-06-06
    Implementation is Semantic Interpretation.Willam J. Rapaport - 1999 - The Monist 82 (1):109-130.
    What is the computational notion of “implementation”? It is not individuation, instantiation, reduction, or supervenience. It is, I suggest, semantic interpretation.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  17. added 2019-05-30
    Does the Solar System Compute the Laws of Motion?Douglas Ian Campbell & Yi Yang - forthcoming - Synthese:1-18.
    The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two horns (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18. added 2019-02-18
    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 and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19. added 2019-01-27
    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 reference (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  20. added 2019-01-25
    Individuation Without Representation.Joe Dewhurst - 2018 - British Journal for the Philosophy of Science 69 (1):103-116.
    ABSTRACT Shagrir and Sprevak explore the apparent necessity of representation for the individuation of digits in computational systems.1 1 I will first offer a response to Sprevak’s argument that does not mention Shagrir’s original formulation, which was more complex. I then extend my initial response to cover Shagrir’s argument, thus demonstrating that it is possible to individuate digits in non-representational computing mechanisms. I also consider the implications that the non-representational individuation of digits would have for the broader theory of computing (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  21. added 2019-01-05
    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 efficiency, cost, reliability, (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  22. added 2018-10-22
    How to Explain Miscomputation.Chris Tucker - 2018 - Philosophers' Imprint 18:1-17.
    Just as theory of representation is deficient if it can’t explain how misrepresentation is possible, a theory of computation is deficient if it can’t explain how miscomputation is possible. Nonetheless, philosophers have generally ignored miscomputation. My primary goal in this paper is to clarify both what miscomputation is and how to adequately explain it. Miscomputation is a special kind of malfunction: a system miscomputes when it computes in a way that it shouldn’t. To explain miscomputation, you must provide accounts of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23. added 2018-10-04
    The Cognitive Basis of Computation: Putting Computation in Its Place.Daniel D. Hutto, Erik Myin, Anco Peeters & Farid Zahnoun - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. London: Routledge. pp. 272-282.
    The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition and not (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  24. added 2018-08-20
    The Swapping Constraint.Henry Schiller - 2018 - Minds and Machines 28 (3):605-622.
    Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states. In this paper, I propose a novel constraint on the kinds of physical states that can implement computational states, which helps to specify what it is for two physical states to non-trivially implement the same (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25. added 2018-03-05
    Physical Perspectives on Computation, Computational Perspectives on Physics.Michael E. Cuffaro & Samuel C. Fletcher (eds.) - 2018 - Cambridge University Press.
    Although computation and the science of physical systems would appear to be unrelated, there are a number of ways in which computational and physical concepts can be brought together in ways that illuminate both. This volume examines fundamental questions which connect scholars from both disciplines: is the universe a computer? Can a universal computing machine simulate every physical process? What is the source of the computational power of quantum computers? Are computational approaches to solving physical problems and paradoxes always fruitful? (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26. added 2018-01-25
    A Mechanistic Account of Wide Computationalism.Luke Kersten - 2017 - Review of Philosophy and Psychology 8 (3):501-517.
    The assumption that psychological states and processes are computational in character pervades much of cognitive science, what many call the computational theory of mind. In addition to occupying a central place in cognitive science, the computational theory of mind has also had a second life supporting “individualism”, the view that psychological states should be taxonomized so as to supervene only on the intrinsic, physical properties of individuals. One response to individualism has been to raise the prospect of “wide computational systems”, (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27. added 2018-01-18
    Mechanisms in Cognitive Science.Carlos Zednik - 2017 - In Phyllis McKay Illari & Stuart Glennan (eds.), The Routledge Handbook of Mechanisms and Mechanical Philosophy. London: Routledge. pp. 389-400.
    This chapter subsumes David Marr’s levels of analysis account of explanation in cognitive science under the framework of mechanistic explanation: Answering the questions that define each one of Marr’s three levels is tantamount to describing the component parts and operations of mechanisms, as well as their organization, behavior, and environmental context. By explicating these questions and showing how they are answered in several different cognitive science research programs, this chapter resolves some of the ambiguities that remain in Marr’s account, and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28. added 2017-11-05
    Book Review: Jeff Buechner, Gödel, Putnam, and Functionalism: A New Reading of Representation and Reality. [REVIEW]Witold M. Hensel & Marcin Miłkowski - 2014 - Journal of Cognitive Science 15 (3):391-402.
  29. added 2017-11-04
    The False Dichotomy Between Causal Realization and Semantic Computation.Marcin Miłkowski - 2017 - Hybris. Internetowy Magazyn Filozoficzny 38:1-21.
    In this paper, I show how semantic factors constrain the understanding of the computational phenomena to be explained so that they help build better mechanistic models. In particular, understanding what cognitive systems may refer to is important in building better models of cognitive processes. For that purpose, a recent study of some phenomena in rats that are capable of ‘entertaining’ future paths (Pfeiffer and Foster 2013) is analyzed. The case shows that the mechanistic account of physical computation may be complemented (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30. added 2017-05-31
    Many-Valued Logics. A Mathematical and Computational Introduction.Luis M. Augusto - 2020 - London: College Publications.
    2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  31. added 2017-05-06
    A Simplicity Criterion for Physical Computation.Tyler Millhouse - 2019 - British Journal for the Philosophy of Science 70 (1):153-178.
    The aim of this paper is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a computational interpretation as an ordered pair of functions mapping (1) states of a physical system to states of an abstract machine, and (2) inputs to this machine to interventions in this physical system. This interpretation must ensure that counterfactuals true of the abstract machine have appropriate counterparts which are (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32. added 2017-04-25
    Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
    Under what conditions does a physical system implement or realize a computation? Structuralism about computational implementation, espoused by Chalmers and others, holds that a physical system realizes a computation just in case the system instantiates a pattern of causal organization isomorphic to the computation’s formal structure. I argue against structuralism through counter-examples drawn from computer science. On my opposing view, computational implementation sometimes requires instantiating semantic properties that outstrip any relevant pattern of causal organization. In developing my argument, I defend (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  33. added 2017-04-25
    Resolving Arguments by Different Conceptual Traditions of Realization.Ronald Endicott - 2012 - Philosophical Studies 159 (1):41-59.
    There is currently a significant amount of interest in understanding and developing theories of realization. Naturally arguments have arisen about the adequacy of some theories over others. Many of these arguments have a point. But some can be resolved by seeing that the theories of realization in question are not genuine competitors because they fall under different conceptual traditions with different but compatible goals. I will first describe three different conceptual traditions of realization that are implicated by the arguments under (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34. added 2017-04-25
    Realization for Causal Nondeterministic Input-Output Systems.Norman Y. Foo & Pavlos Peppas - 2001 - Studia Logica 67 (3):419-437.
    There are two well-developed formalizations of discrete time dynamic systems that evidently share many concerns but suffer from a lack of mutual awareness. One formalization is classical systems and automata theory. The other is the logic of actions in which the situation and event calculi are the strongest representatives. Researchers in artificial intelligence are likely to be familiar with the latter but not the former. This is unfortunate, for systems and automata theory have much to offer by way of insight (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35. added 2017-04-25
    Computational Commitment and Physical Realization.Robert M. Harrish - 1983 - Behavioral and Brain Sciences 6 (3):408-409.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36. added 2017-04-25
    A New Lilliputian Argument Against Machine Functionalism.William G. Lycan - 1979 - Philosophical Studies 35 (April):279-87.
  37. added 2017-02-13
    Effective Procedures Versus Elementary Units of Behavior.John M. Hollerbach - 1981 - Behavioral and Brain Sciences 4 (4):625-627.
  38. added 2017-01-26
    Effective Blood Volume: An Effective Concept or a Modern Myth.Alastair Michell - 1996 - Perspectives in Biology and Medicine 39 (4):471-490.
  39. added 2017-01-24
    Understanding the Implementation of a Complex Intervention Aiming to Change a Health Professional Role: A Conceptual Framework for Implementation Evaluation.Abou-Malham Sabina, Hatem Marie & Leduc Nicole - 2013 - Open Journal of Philosophy 3 (4):491.
    This paper proposes a conceptual framework for understanding the implementation process of a complex intervention concerned with professional role change. The proposed framework holds that the intervention must address three interacting systems (socio-cultural, educational and disciplinary) through which a health professional role is evolved. Each system is operationalized by four dimensions (values, methods, actors and targets). As for the implementation, the framework posits that it can be analyzed, by depicting the barriers and facilitators located within the dimensions of the three (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  40. added 2017-01-23
    Globalisation and Local Innovation System: The Implementation of Government Policies to the Formation of Science Parks in Japan. [REVIEW]Sang-Chul Park - 2001 - AI and Society 15 (3):263-279.
  41. added 2017-01-23
    Implementation of Self-Managed Teams in Manufacturing: More of a Marathon Than a Sprint. [REVIEW]John R. Wilson & Claire M. Whittington - 2001 - AI and Society 15 (1-2):58-81.
    During the past decade teamwork in manufacturing, as in other sectors, has become the organisational form of choice. In contrast to earlier manifestations such as autonomous workgroups some 30 years earlier, this appears to have been largely for business and production reasons rather than being directly aimed at improving the quality of work life. Taken from part of a larger study of teamworking in several different manufacturing companies this paper draws upon a retrospective analysis of cases of self-managed team implementation (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42. added 2017-01-14
    Implementation of a Group-Based Physical Activity Programme for Ageing Adults with ID: A Process Evaluation.Marieke van Schijndel-Speet, Heleen M. Evenhuis, Ruud van Wijck & Michael A. Echteld - 2014 - Journal of Evaluation in Clinical Practice 20 (4):401-407.
  43. added 2016-12-08
    Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
    Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation”. But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term “accelerating Turing machine” is used (...)
    Remove from this list   Direct download (13 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  44. added 2016-12-08
    Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.
    There is an intensive discussion nowadays about the meaning of effective computability, with implications to the status and provability of the Church–Turing Thesis (CTT). I begin by reviewing what has become the dominant account of the way Turing and Church viewed, in 1936, effective computability. According to this account, to which I refer as the Gandy–Sieg account, Turing and Church aimed to characterize the functions that can be computed by a human computer. In addition, Turing provided a highly convincing argument (...)
    Remove from this list   Direct download (15 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  45. added 2016-10-11
    A Cognitive Computation Fallacy? Cognition, Computations and Panpsychism.John Mark Bishop - 2009 - Cognitive Computation 1 (3):221-233.
    The journal of Cognitive Computation is defined in part by the notion that biologically inspired computational accounts are at the heart of cognitive processes in both natural and artificial systems. Many studies of various important aspects of cognition (memory, observational learning, decision making, reward prediction learning, attention control, etc.) have been made by modelling the various experimental results using ever-more sophisticated computer programs. In this manner progressive inroads have been made into gaining a better understanding of the many components of (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  46. added 2016-10-11
    Why Computers Can't Feel Pain.John Mark Bishop - 2009 - Minds and Machines 19 (4):507-516.
    The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47. added 2016-10-11
    Dancing with Pixies: Strong Artificial Intelligence and Panpsychism.John Mark Bishop - 2002 - In John M. Preston & John Mark Bishop (eds.), Views into the Chinese Room: New Essays on Searle and Artificial Intelligence. Oxford University Press. pp. 360-379.
    The argument presented in this paper is not a direct attack or defence of the Chinese Room Argument (CRA), but relates to the premise at its heart, that syntax is not sufficient for semantics, via the closely associated propositions that semantics is not intrinsic to syntax and that syntax is not intrinsic to physics. However, in contrast to the CRA’s critique of the link between syntax and semantics, this paper will explore the associated link between syntax and physics. The main (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. added 2016-10-11
    Counterfactuals Cannot Count: A Rejoinder to David Chalmers.John Mark Bishop - 2002 - Consciousness and Cognition 11 (4):642-652.
    The initial argument presented herein is not significantly original—it is a simple reflection upon a notion of computation originally developed by Putnam and criticised by Chalmers et al. . In what follows, instead of seeking to justify Putnam’s conclusion that every open system implements every Finite State Automaton and hence that psychological states of the brain cannot be functional states of a computer, I will establish the weaker result that, over a finite time window every open system implements the trace (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  49. added 2016-07-12
    Computational Mechanisms and Models of Computation.Marcin Miłkowski - 2014 - Philosophia Scientae 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 of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50. added 2016-06-30
    System, Subsystem, Hive: Boundary Problems in Computational Theories of Consciousness.Tomer Fekete, Cees van Leeuwen & Shimon Edelman - 2016 - Frontiers in Psychology 7.
    A computational theory of consciousness should include a quantitative measure of consciousness, or MoC, that (i) would reveal to what extent a given system is conscious, (ii) would make it possible to compare not only different systems, but also the same system at different times, and (iii) would be graded, because so is consciousness. However, unless its design is properly constrained, such an MoC gives rise to what we call the boundary problem: an MoC that labels a system as conscious (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 127