Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!unc!mcnc!philabs!cmcl2!seismo!elsie!cvl!harwood
From: harwood@cvl.UUCP (David Harwood)
Newsgroups: net.ai
Subject: Re: Re: A halting problem
Message-ID: <1119@cvl.UUCP>
Date: Sat, 18-Jan-86 12:18:21 EST
Article-I.D.: cvl.1119
Posted: Sat Jan 18 12:18:21 1986
Date-Received: Mon, 20-Jan-86 06:36:46 EST
References: <2175@aecom.UUCP> <2540002@csd2.UUCP> <2191@aecom.UUCP> <1040@mmintl.UUCP>
Reply-To: harwood@cvl.UUCP (David Harwood)
Organization: Computer Vision Lab, U. of Maryland, College Park
Lines: 27

In article <1040@mmintl.UUCP> franka@mmintl.UUCP (Frank Adams) writes:
>In article <2191@aecom.UUCP> berger@aecom.UUCP (Micha Berger) writes:
>>> []
>>> > The human mind, on the other hand, given enough time an
>>> > practice, can find an endless loop in any procedure.
>>> 
>>> Does the following procedure contain an endless loop?
>>> 
>>> for (each possible quadruple <a,b,c,n> of natural numbers,
>>> 		in any systematic order)
>>> 	if (a**n + b**n == c**n)
>>> 		halt();
>>> 
>>
>>Given 10^19 years, I think I could do it. (We said theoretically possible,
>>not realistic (-:
>
>Given 10^19 years, maybe you could.  Then again, maybe you couldn't.  The
>only way to know for sure is to try it. :-)
>
>Frank Adams                           ihpn4!philabs!pwa-b!mmintl!franka
>Multimate International    52 Oakland Ave North    E. Hartford, CT 06108


	Indeed, this will be a flash-card exercise in arithmetic
for Micha in Heaven.
					David Harwood