Switch to: Citations

Add references

You must login to add references.
  1. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
    Download  
     
    Export citation  
     
    Bookmark   718 citations  
  • (1 other version)Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Finite combinatory processes—formulation.Emil L. Post - 1936 - Journal of Symbolic Logic 1 (3):103-105.
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • (5 other versions)Minds, Machines and Gödel.J. R. Lucas - 1961 - Etica E Politica 5 (1):1.
    In this article, Lucas maintains the falseness of Mechanism - the attempt to explain minds as machines - by means of Incompleteness Theorem of Gödel. Gödel’s theorem shows that in any system consistent and adequate for simple arithmetic there are formulae which cannot be proved in the system but that human minds can recognize as true; Lucas points out in his turn that Gödel’s theorem applies to machines because a machine is the concrete instantiation of a formal system: therefore, for (...)
    Download  
     
    Export citation  
     
    Bookmark   165 citations  
  • (1 other version)The Calculi of Lambda-Conversion.Barkley Rosser - 1941 - Journal of Symbolic Logic 6 (4):171-171.
    Download  
     
    Export citation  
     
    Bookmark   56 citations