Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83; site rochester.UUCP Path: utzoo!watmath!clyde!floyd!harpo!seismo!rochester!sher From: sher@rochester.UUCP (David Sher) Newsgroups: net.ai,net.math Subject: Re: Fermat's Last Theorem Message-ID: <4797@rochester.UUCP> Date: Wed, 8-Feb-84 17:28:05 EST Article-I.D.: rocheste.4797 Posted: Wed Feb 8 17:28:05 1984 Date-Received: Fri, 10-Feb-84 03:09:34 EST References: <16403@sri-arpa.UUCP> Organization: U. of Rochester, CS Dept. Lines: 9 The interesting part of the proof of the 4 color theorem was the proof that you need only check it for a finite set of special cases. This was proved some time ago. (I think, I'm not a graph theorist so am not authoritative) If you believe this then the 4 color theorem is definitely decidable. You may dispute the efficacy of this particular proof technique. -David Sher (ofttimes AI project) {he's back} sher@rochester seismo!rochester!sher