35 found
Order:
  1. The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
    There are various equivalent formulations of the Church-Turing thesis. A common one is that every effective computation can be carried out by a Turing machine. The Church-Turing thesis is often misunderstood, particularly in recent writing in the philosophy of mind.
    Direct download  
     
    Export citation  
     
    Bookmark   53 citations  
  2. What is computation?B. Jack Copeland - 1996 - Synthese 108 (3):335-59.
    To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of computation against (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   88 citations  
  3. The genesis of possible worlds semantics.B. Jack Copeland - 2002 - Journal of Philosophical Logic 31 (2):99-137.
    This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   56 citations  
  4.  51
    The indeterminacy of computation.Nir Fresco, B. Jack Copeland & Marty J. Wolf - 2021 - Synthese 199 (5-6):12753-12775.
    Do the dynamics of a physical system determine what function the system computes? Except in special cases, the answer is no: it is often indeterminate what function a given physical system computes. Accordingly, care should be taken when the question ‘What does a particular neuronal system do?’ is answered by hypothesising that the system computes a particular function. The phenomenon of the indeterminacy of computation has important implications for the development of computational explanations of biological systems. Additionally, the phenomenon lends (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5. Hypercomputation.B. Jack Copeland - 2002 - Minds and Machines 12 (4):461-502.
  6. The Turing test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.
    Turing''s test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  7. Narrow Versus Wide Mechanism: Including a Re-Examination of Turing’s Views on the Mind-Machine Issue.B. Jack Copeland - 2000 - Journal of Philosophy 97 (1):5-32.
  8. Artificial Intelligence: A Philosophical Introduction.B. Jack Copeland - 1993 - Cambridge: Blackwell.
    Presupposing no familiarity with the technical concepts of either philosophy or computing, this clear introduction reviews the progress made in AI since the inception of the field in 1956. Copeland goes on to analyze what those working in AI must achieve before they can claim to have built a thinking machine and appraises their prospects of succeeding.There are clear introductions to connectionism and to the language of thought hypothesis which weave together material from philosophy, artificial intelligence and neuroscience. John Searle's (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  9. 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” (Potgieter and Rosinger 2010: 853). 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 (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  10.  91
    Beyond the universal Turing machine.B. Jack Copeland & Richard Sylvan - 1999 - Australasian Journal of Philosophy 77 (1):46-66.
  11. Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
    Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  12. The Essential Turing.B. Jack Copeland - 2005 - Bulletin of Symbolic Logic 11 (4):541-542.
     
    Export citation  
     
    Bookmark   24 citations  
  13.  84
    Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
    Turing’s analysis of computability has recently been challenged; it is claimed that it is circular to analyse the intuitive concept of numerical computability in terms of the Turing machine. This claim threatens the view, canonical in mathematics and cognitive science, that the concept of a systematic procedure or algorithm is to be explicated by reference to the capacities of Turing machines. We defend Turing’s analysis against the challenge of ‘deviant encodings’.Keywords: Systematic procedure; Turing machine; Church–Turing thesis; Deviant encoding; Acceptable encoding; (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  14. Super turing-machines.B. Jack Copeland - 1998 - Complexity 4 (1):30-32.
  15. Physical Computation: How General are Gandy’s Principles for Mechanisms?B. Jack Copeland & Oron Shagrir - 2007 - Minds and Machines 17 (2):217-231.
    What are the limits of physical computation? In his ‘Church’s Thesis and Principles for Mechanisms’, Turing’s student Robin Gandy proved that any machine satisfying four idealised physical ‘principles’ is equivalent to some Turing machine. Gandy’s four principles in effect define a class of computing machines (‘Gandy machines’). Our question is: What is the relationship of this class to the class of all (ideal) physical computing machines? Gandy himself suggests that the relationship is identity. We do not share this view. We (...)
    Direct download (13 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  16. The chinese room from a logical point of view.B. Jack Copeland - 2003 - In John M. Preston & John Mark Bishop (eds.), Views Into the Chinese Room: New Essays on Searle and Artificial Intelligence. Oxford University Press.
     
    Export citation  
     
    Bookmark   9 citations  
  17. The curious case of the chinese gym.B. Jack Copeland - 1993 - Synthese 95 (2):173-86.
    Searle has recently used two adaptations of his Chinese room argument in an attack on connectionism. I show that these new forms of the argument are fallacious. First I give an exposition of and rebuttal to the original Chinese room argument, and then a brief introduction to the essentials of connectionism.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  18.  26
    Arthur prior.B. Jack Copeland - 2008 - Stanford Encyclopedia of Philosophy.
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  19.  85
    On Vague Objects, Fuzzy Logic and Fractal Boundaries.B. Jack Copeland - 1995 - Southern Journal of Philosophy 33 (S1):83-96.
  20.  77
    The modern history of computing.B. Jack Copeland - 2008 - Stanford Encyclopedia of Philosophy.
  21. Vague identity and fuzzy logic.B. Jack Copeland - 1997 - Journal of Philosophy 94 (10):514-534.
  22.  19
    Vague Identity and Fuzzy Logic.B. Jack Copeland - 1997 - Journal of Philosophy 94 (10):514.
  23.  21
    The Sanjaya Myth: Sanjaya Belatthiputta and the Catuskoti.B. Jack Copeland & Syed Moynul Alam Nizar - forthcoming - Philosophy East and West.
    Respected modern scholars regard the pre-Buddhist philosopher Sañjaya Belaṭṭhiputta—a significant figure in the Buddhist canon—as the originator of the important classical argument- forms known as the catuṣkoṭi and catuṣkoṭi vinirmukta. We argue that the early Buddhist texts do not in fact support this view of the origin of these argument-forms; the question of their origin is open. While it is certainly true that the Pāli Sāmaññaphala Sutta and some of its parallels portray Sañjaya as deploying the catuṣkoṭi, there is nothing (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. Meredith, Prior, and the History of Possible Worlds Semantics.B. Jack Copeland - 2006 - Synthese 150 (3):373-397.
    This paper charts some early history of the possible worlds semantics for modal logic, starting with the pioneering work of Prior and Meredith. The contributions of Geach, Hintikka, Kanger, Kripke, Montague, and Smiley are also discussed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  25.  74
    Prior, translational semantics, and the Barcan formula.B. Jack Copeland - 2016 - Synthese 193 (11):3507-3519.
    The revolution in semantics in the late 1960s and 1970s overturned an earlier competing paradigm, ‘translational’ semantics. I revive and defend Prior’s translational semantics for modals and tense-modals. I also show how to extend Prior’s propositional modal semantics to quantificational modal logic, and use the resulting semantics to formalize Prior’s own counterexample to the Barcan Formula.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  73
    Turing and Von Neumann: From Logic to the Computer.B. Jack Copeland & Zhao Fan - 2023 - Philosophies 8 (2):22.
    This article provides a detailed analysis of the transfer of a key cluster of ideas from mathematical logic to computing. We demonstrate the impact of certain of Turing’s logico-philosophical concepts from the mid-1930s on the emergence of the modern electronic computer—and so, in consequence, Turing’s impact on the direction of modern philosophy, via the computational turn. We explain why both Turing and von Neumann saw the problem of developing the electronic computer as a problem in logic, and we describe their (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. Prior's life and legacy.B. Jack Copeland - 1996 - In Logic and Reality: Essays on the Legacy of Arthur Prior. Oxford University Press. pp. 1--40.
    No categories
     
    Export citation  
     
    Bookmark   3 citations  
  28.  25
    Correction to: On Alan Turing's anticipation of connectionism.Diane Proudfoot & B. Jack Copeland - 2023 - Synthese 201 (2):1-2.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  30
    Alan Turing's Automatic Computing Engine: The Master Codebreaker's Struggle to build the Modern Computer.B. Jack Copeland (ed.) - 2005 - Oxford University Press.
    The mathematical genius Alan Turing, well known for his crucial wartime role in breaking the ENIGMA code, was the first to conceive of the fundamental principle of the modern computer. This text contains first hand accounts by Turing and by the pioneers of computing who worked with him on his revolutionary design for an electronic computing machine - his Automatic Computing Engine.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  94
    Indeterminate Identity, Contingent Identity, and Property Identity, Aristotelian-Style.B. Jack Copeland - 2000 - Philosophical Topics 28 (1):11-25.
  31.  8
    Alan Turing's Electronic Brain: The Struggle to Build the Ace, the World's Fastest Computer.B. Jack Copeland (ed.) - 2012 - Oxford University Press.
    Well known for this crucial wartime role in breaking the ENIGMA code, this book chronicles Turing's struggle to build the modern computer. Includes first hand accounts by Turing and the pioneers of computing who worked with him.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  21
    Commentary.B. Jack Copeland - 1995 - Southern Journal of Philosophy 33 (Supplement):83-96.
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  15
    From the Entscheidungsproblem to the Personal Computer–and Beyond.B. Jack Copeland - 2011 - In Matthias Baaz (ed.), Kurt Gödel and the foundations of mathematics: horizons of truth. New York: Cambridge University Press. pp. 151.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  34.  16
    Indeterminate Identity, Contingent Identity, and Property Identity, Aristotelian-Style.B. Jack Copeland - 2000 - Philosophical Topics 28 (1):11-25.
  35.  4
    Turing’s Thesis.B. Jack Copeland - 2006 - In Adam Olszewski, Jan Wolenski & Robert Janusz (eds.), Church's Thesis After 70 Years. Ontos Verlag. pp. 147-174.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark