Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site aecom.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!akgua!gatech!seismo!cmcl2!philabs!aecom!berger
From: berger@aecom.UUCP (Micha Berger)
Newsgroups: net.ai
Subject: Re: Re: A halting problem
Message-ID: <2191@aecom.UUCP>
Date: Tue, 14-Jan-86 00:58:33 EST
Article-I.D.: aecom.2191
Posted: Tue Jan 14 00:58:33 1986
Date-Received: Fri, 17-Jan-86 01:08:24 EST
References: <2175@aecom.UUCP> <2540002@csd2.UUCP>
Organization: Yeshiva University, NYC, NY
Lines: 14

> []
> > 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 (-: