home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.lang.c:16304 comp.lang.c++:16064 comp.lang.pascal:6472 comp.lang.misc:3578
- Path: sparky!uunet!ferkel.ucsb.edu!taco!rock!stanford.edu!ames!sun-barr!cs.utexas.edu!ut-emx!ibmchs!auschs!portal.austin.ibm.com!awdprime.austin.ibm.com!testsys.austin.ibm.com!mbrown
- From: mbrown@testsys.austin.ibm.com (Mark Brown)
- Newsgroups: comp.lang.c,comp.lang.c++,comp.lang.pascal,comp.lang.misc
- Subject: Re: Godel's Proof (was Re: Software design =/= Programming)
- Message-ID: <1992Nov10.193449.17264@awdprime.austin.ibm.com>
- Date: 10 Nov 92 19:34:49 GMT
- References: <1992Nov8.031423.16207@ucc.su.OZ.AU> <1992Nov9.144550.28811@us-es.sel.de> <LOEGEL.92Nov9134531@fegatello.ssc.gov>
- Sender: news@awdprime.austin.ibm.com (USENET News)
- Organization: IBM Corp., Austin TX.
- Lines: 23
-
- | loegel@sscvx1.ssc.gov writes:
- |From the McGraw-Hill Dictionary of Science and Technology:
- |Godel's Proof: Any formal arithmetical system is incomplete in the
- |
- |The full proof *is* wonderful -- we took six weeks going through it in
- |class. Also, Raymond Smullyan has just published a book (Oxford Press)
- |where he gives *three* different proofs of the Incompleteness Theorem.
- |Smullyan is a wonderful author (e.g. "Forever Undecided : a puzzle
- |guide to Godel" and "To Mock a Mockingbird") and I recommend any of
- |the books.
-
- Shame on you for not recommending GODEL, ESCHER, BACH: An Eternal Golden
- Braid, by Douglas Hofstadter.
-
- Not only a good explanation of Godel, but he ties it back into
- programming and AI.
-
- mark
- --
- Mark Brown IBM PSP Austin, TX.|Make it right before you make it faster.
- (512) 838-3926 VNET: MBROWN@AUSVMQ|Keep it right when you make it faster.
- MAIL: mbrown@testsys.austin.ibm.com |Make it clear before you make it faster.
- DISCLAIMER: My views may be, and often are, independent of IBM official policy.
-