Switch to: References

Add citations

You must login to add citations.
  1. Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
    We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • ‘Ed Tech in Reverse’: Information technologies and the cognitive revolution.Andrew Feenberg Norm Friesen - 2007 - Educational Philosophy and Theory 39 (7):720-736.
    As we rapidly approach the 50th year of the much‐celebrated ‘cognitive revolution’, it is worth reflecting on its widespread impact on individual disciplines and areas of multidisciplinary endeavour. Of specific concern in this paper is the example of the influence of cognitivism's equation of mind and computer in education. Within education, this paper focuses on a particular area of concern to which both mind and computer are simultaneously central: educational technology. It examines the profound and lasting effect of cognitive science (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Symbol grounding in computational systems: A paradox of intentions.Vincent C. Müller - 2009 - Minds and Machines 19 (4):529-541.
    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. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified such (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Epistemic Diversity and the Question of Lingua Franca in Science and Philosophy.Federico Gobbo & Federica Russo - 2020 - Foundations of Science 25 (1):185-207.
    Epistemic diversity is the ability or possibility of producing diverse and rich epistemic apparati to make sense of the world around us. In this paper we discuss whether, and to what extent, different conceptions of knowledge—notably as ‘justified true belief’ and as ‘distributed and embodied cognition’—hinder or foster epistemic diversity. We then link this discussion to the widespread move in science and philosophy towards monolingual disciplinary environments. We argue that English, despite all appearance, is no Lingua Franca, and we give (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • ‘Ed Tech in Reverse’: Information technologies and the cognitive revolution.Norm Friesen & Andrew Feenberg - 2007 - Educational Philosophy and Theory 39 (7):720–736.
    As we rapidly approach the 50th year of the much‐celebrated ‘cognitive revolution’, it is worth reflecting on its widespread impact on individual disciplines and areas of multidisciplinary endeavour. Of specific concern in this paper is the example of the influence of cognitivism's equation of mind and computer in education. Within education, this paper focuses on a particular area of concern to which both mind and computer are simultaneously central: educational technology. It examines the profound and lasting effect of cognitive science (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Turing and the Real Girl.Yasemin J. Erden & Stephen Rainey - 2012 - The New Bioethics 18 (2):133-144.
    In 1950 Alan Turing asked whether machines could think. This question has been vigorously debated since, and its relevance for machine intelligence, or even agency, continues to provoke interdisciplinary debate. In fact, Turing’s next step in his paper is to ask a far more nuanced question about imitation, which, we suggest, assumes a number of connections between intelligence, agency and the possibility of imitation. This paper will offer three key arguments against these assumptions, and in so doing make the following (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Turing’s algorithmic lens: From computability to complexity theory.Josep Díaz & Carme Torras - 2013 - Arbor 189 (764):a080.
    Download  
     
    Export citation  
     
    Bookmark  
  • Towards a Historical Notion of ‘Turing—the Father of Computer Science’.Edgar G. Daylight - 2015 - History and Philosophy of Logic 36 (3):205-228.
    In the popular imagination, the relevance of Turing's theoretical ideas to people producing actual machines was significant and appreciated by everybody involved in computing from the moment he published his 1936 paper ‘On Computable Numbers’. Careful historians are aware that this popular conception is deeply misleading. We know from previous work by Campbell-Kelly, Aspray, Akera, Olley, Priestley, Daylight, Mounier-Kuhn, Haigh, and others that several computing pioneers, including Aiken, Eckert, Mauchly, and Zuse, did not depend on Turing's 1936 universal-machine concept. Furthermore, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Física da Terminação.José Félix Costa - 2016 - Kairos 16 (1):14-60.
    Sumário Mostramos que, em virtude dos limites teóricos da computação, nem toda a ciência formulada com carácter preditivo pode ser simulada. Em particular, evidencia- se que a Fisica Clássica, nomeadamente a Físíca Newtoniana, padece deste mal, encerrando processos de Zenão.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Incompleteness and the Halting Problem.Cristian S. Calude - 2021 - Studia Logica 109 (5):1159-1169.
    We present an abstract framework in which we give simple proofs for Gödel’s First and Second Incompleteness Theorems and obtain, as consequences, Davis’, Chaitin’s and Kritchman-Raz’s Theorems.
    Download  
     
    Export citation  
     
    Bookmark  
  • Who Discovered the Binary System and Arithmetic? Did Leibniz Plagiarize Caramuel?J. Ares, J. Lara, D. Lizcano & M. A. Martínez - 2018 - Science and Engineering Ethics 24 (1):173-188.
    Gottfried Wilhelm Leibniz is the self-proclaimed inventor of the binary system and is considered as such by most historians of mathematics and/or mathematicians. Really though, we owe the groundwork of today’s computing not to Leibniz but to the Englishman Thomas Harriot and the Spaniard Juan Caramuel de Lobkowitz, whom Leibniz plagiarized. This plagiarism has been identified on the basis of several facts: Caramuel’s work on the binary system is earlier than Leibniz’s, Leibniz was acquainted—both directly and indirectly—with Caramuel’s work and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computability and complexity.Neil Immerman - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Symbiotic Phenomenon in the Evolutive Context.Francisco Carrapiço - 2012 - In Torres Juan, Pombo Olga, Symons John & Rahman Shahid (eds.), Special Sciences and the Unity of Science. Springer. pp. 113--119.
    Download  
     
    Export citation  
     
    Bookmark  
  • Scientific phenomena and patterns in data.Pascal Ströing - 2018 - Dissertation, Lmu München
    Download  
     
    Export citation  
     
    Bookmark