Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: utzoo!watmath!clyde!floyd!harpo!ihnp4!inuxc!pur-ee!uiucdcs!parsec!ctvax!uokvax!andree From: andree@uokvax.UUCP Newsgroups: net.ai Subject: Re: intelligence and genius - (nf) Message-ID: <5259@uiucdcs.UUCP> Date: Mon, 30-Jan-84 23:18:33 EST Article-I.D.: uiucdcs.5259 Posted: Mon Jan 30 23:18:33 1984 Date-Received: Tue, 7-Feb-84 06:43:09 EST Lines: 18 #R:sri-arpa:-1568100:uokvax:900010:000:653 uokvax!andree Jan 29 13:53:00 1984 Sorry, js@psuvax, but I DO know something about what I spoke, even if I do have trouble typing. I am aware that theorom-proving machines are impossible. It's also fairly obvious that they would use lots of time and space. However, I didn't even MENTION them. I talked about two flavors of machine. One generated well-formed strings, and the other said whether they were true or not. I didn't say either machine proved them. My point was that the second of these machines is also impossible, and is closely related to Jerry's genius finding machines. [I assume that any statement containing genius is true.] Down with replying without reading!