Xref: utzoo comp.ai:2633 talk.philosophy.misc:1578
Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!nrl-cmf!ames!pasteur!helios.ee.lbl.gov!nosc!humu!uhccux!lee
From: lee@uhccux.uhcc.hawaii.edu (Greg Lee)
Newsgroups: comp.ai,talk.philosophy.misc
Subject: Re: Artificial Intelligence and Intelligence
Message-ID: <2652@uhccux.uhcc.hawaii.edu>
Date: 18 Nov 88 12:20:47 GMT
References: <392@itivax.UUCP>
Organization: University of Hawaii
Lines: 17

From article <392@itivax.UUCP>, by dhw@itivax.UUCP (David H. West):
" In article <88Nov15.170837est.707@neat.ai.toronto.edu> bradb@ai.toronto.edu (Brad Brown) writes:
" >Godel's Incompleteness Theorem is a more general result
" >stating that any axiomatic system of sufficient power will
" >be fundimentally incomplete.  (NB  Systems that are not of
" >'sufficient power' are also not of sufficient interest to
" >consider for the purpose of AI)
" 
" That's by no means obvious.  Formal reasoning is a relatively recent
" addition to the human behavioral repertoire; people do it neither
" naturally (it takes them until well into adolescence to become

And for that matter, we can do a certain amount of formal reasoning
within the bounds of a complete system, since predicate logic
is complete.  Goedel published a proof in 1930.

		Greg, lee@uhccux.uhcc.hawaii.edu