Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site sdcc12.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!houxm!mtuxo!mtunh!vax135!cornell!uw-beaver!tektronix!hplabs!sdcrdcf!sdcsvax!sdcc3!sdcc12!rich
From: rich@sdcc12.UUCP (rich)
Newsgroups: net.philosophy,net.math,net.physics
Subject: Re: Mind and Turing Machines
Message-ID: <476@sdcc12.UUCP>
Date: Tue, 12-Nov-85 00:39:47 EST
Article-I.D.: sdcc12.476
Posted: Tue Nov 12 00:39:47 1985
Date-Received: Thu, 14-Nov-85 07:27:21 EST
References: <1996@umcp-cs.UUCP> <667@hwcs.UUCP> <2031@umcp-cs.UUCP>
Reply-To: rich@sdcc12.UUCP (rich)
Organization: lack of
Lines: 10
Xref: watmath net.philosophy:3114 net.math:2512 net.physics:3552

Can a Turing machine write an inductive proof on an infinite set of
sequences? {An such problem will do}. 

Then, again, from sentential you probably could build such a turing
machine from the correct set of lemmas. But who wrote the lemmas.
Probably some old drunk. Ah ha!!!! Humanity beats out the machine
again.

    -rich
    {I never was much for induction on infinite sequences anyway}