Switch to: Citations

Add references

You must login to add references.
  1. Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
  • Systems of Logic Based on Ordinals.Andrzej Mostowski - 1939 - Journal of Symbolic Logic 4 (3):128-129.
    Direct download  
     
    Export citation  
     
    Bookmark   50 citations  
  • On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
  • Two undecidable problems of analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.
  • Comments on `two undecidable problems of analysis'.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):79-85.
    We first discuss some technical questions which arise in connection with the construction of undecidable propositions in analysis, in particular in connection with the notion of the normal form of a function representing a predicate. Then it is stressed that while a function f(x) may be computable in the sense of recursive function theory, it may nevertheless have undecidable properties in the realm of Fourier analysis. This has an implication for a conjecture of Penrose's which states that classical physics is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The perceptron: A probabilistic model for information storage and organization in the brain.F. Rosenblatt - 1958 - Psychological Review 65 (6):386-408.
    If we are eventually to understand the capability of higher organisms for perceptual recognition, generalization, recall, and thinking, we must first have answers to three fundamental questions: 1. How is information about the physical world sensed, or detected, by the biological system? 2. In what form is information stored, or remembered? 3. How does information contained in storage, or in memory, influence recognition and behavior? The first of these questions is in the.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   170 citations  
  • A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 (1936–1937), pp. 230–265. [REVIEW]Everett J. Nelson & V. C. Aldrich - 1937 - Journal of Symbolic Logic 2 (1):42-43.
  • A Logical Calculus of the Ideas Immanent in Nervous Activity.Warren S. Mcculloch & Walter Pitts - 1943 - Journal of Symbolic Logic 9 (2):49-50.
    Direct download  
     
    Export citation  
     
    Bookmark   186 citations  
  • A logical calculus of the ideas immanent in nervous activity.Warren S. McCulloch & Walter Pitts - 1943 - The Bulletin of Mathematical Biophysics 5 (4):115-133.
    Because of the “all-or-none” character of nervous activity, neural events and the relations among them can be treated by means of propositional logic. It is found that the behavior of every net can be described in these terms, with the addition of more complicated logical means for nets containing circles; and that for any logical expression satisfying certain conditions, one can find a net behaving in the fashion it describes. It is shown that many particular choices among possible neurophysiological assumptions (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   442 citations  
  • Mathematical proof.G. H. Hardy - 1929 - Mind 38 (149):1-25.
  • Turing A. M.. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society, 2 s. vol. 42 , pp. 230–265. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):42-43.
  • Strauss M.. Zur Begründung der statistischen Transformationstheorie der Quantenphysik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 1936, pp. 382–398. [REVIEW]Alonzo Church - 1937 - Journal of Symbolic Logic 2 (1):45-45.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Grundzüge der theoretischen Logik.D. Hilbert & W. Ackermann - 1928 - Annalen der Philosophie Und Philosophischen Kritik 7:157-157.
    No categories
     
    Export citation  
     
    Bookmark   202 citations  
  • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.K. Gödel - 1931 - Monatshefte für Mathematik 38 (1):173--198.
     
    Export citation  
     
    Bookmark   240 citations  
  • Conscious events as orchestrated space-time selections.Stuart R. Hameroff & Roger Penrose - 1996 - Journal of Consciousness Studies 3 (1):36-53.
    What is consciousness? Some philosophers have contended that ‘qualia’, or an experiential medium from which consciousness is derived, exists as a fundamental component of reality. Whitehead, for example, described the universe as being comprised of ‘occasions of experience’. To examine this possibility scientifically, the very nature of physical reality must be re-examined. We must come to terms with the physics of space-time -- as is described by Einstein's general theory of relativity -- and its relation to the fundamental theory of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   82 citations  
  • From ENIAC to the stored program computer : two revolutions in computers.Arthur W. Burks - unknown
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Alan Turing’s Forgotten Ideas in Computer Science.Diane Proudfoot & Jack Copeland - 1999 - Scientific American 280 (4):99-103.
    No categories
     
    Export citation  
     
    Bookmark   10 citations