Switch to: References

Add citations

You must login to add citations.
  1. Remarks on the Gödelian Anti-Mechanist Arguments.Panu Raatikainen - 2020 - Studia Semiotyczne 34 (1):267–278.
    Certain selected issues around the Gödelian anti-mechanist arguments which have received less attention are discussed.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Contradiction as a Positive Property of the Mind: 90 Years of Gödel’s Argument.Dmitriy V. Vinnik - 2022 - Russian Journal of Philosophical Sciences 64 (7):26-45.
    The article discusses the V.V. Tselishchev’s original and unique systematic study of the specific and extremely complicated problems of Gödel results regarding the question of artificial intelligence essence. Tselishchev argues that the reflexive property should be considered not only as an advantage of human reasoning, but also as an objective internal limitation that appears in case of adding Gödel sentence to a theory to build a new theory. The article analyzes so-called mentalistic Gödel’s argument for fundamental superiority of human intelligence (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Use and Misuse of Godel's Theorem.Shingo Fujita - 2003 - Annals of the Japan Association for Philosophy of Science 12 (1):1-14.
    Download  
     
    Export citation  
     
    Bookmark  
  • Mechanical intelligence and Godelian Arguments.Vincenzo Fano - 2013 - Epistemologia 36 (2):207-232.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Mechanical intelligence and Godelian Arguments.Vincenzo Fano - 2014 - Epistemologia 2:207-232.
    Download  
     
    Export citation  
     
    Bookmark  
  • The philosophy of computer science.Raymond Turner - 2013 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Penrose's Gödelian Argument A Review of Shadows of the Mind by Roger Penrose. [REVIEW]S. Feferman - 1995 - PSYCHE: An Interdisciplinary Journal of Research On Consciousness 2:21-32.
    In his book Shadows of the Mind: A search for the missing science of con- sciousness [SM below], Roger Penrose has turned in another bravura perfor- mance, the kind we have come to expect ever since The Emperor’s New Mind [ENM ] appeared. In the service of advancing his deep convictions and daring conjectures about the nature of human thought and consciousness, Penrose has once more drawn a wide swath through such topics as logic, computa- tion, artificial intelligence, quantum physics (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On the necessary philosophical premises of the Goedelian arguments.Fano Vincenzo & Graziani Pierluigi - unknown
    Lucas-Penrose type arguments have been the focus of many papers in the literature. In the present paper we attempt to evaluate the consequences of Gödel’s incompleteness theorems for the philosophy of the mind. We argue that the best answer to this question was given by Gödel already in 1951 when he realized that either our intellectual capability is not representable by a Turing Machine, or we can never know with mathematical certainty what such a machine is. But his considerations became (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
    Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations