Xref: utzoo comp.theory:840 sci.logic:877 sci.math:11666
Path: utzoo!attcan!uunet!lll-winken!uwm.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!emory!hubcap!steve
From: steve@hubcap.clemson.edu ("Steve" Stevenson)
Newsgroups: comp.theory,sci.logic,sci.math
Subject: Re^4: Question About the Four Color Proof
Message-ID: <9649@hubcap.clemson.edu>
Date: 12 Jul 90 13:31:51 GMT
References: <786@qusunu.queensu.CA> <9615@hubcap.clemson.edu> <1212@s8.Morgan.COM>
Organization: Clemson University, Clemson, SC
Lines: 17

amull@Morgan.COM (Andrew P. Mullhaupt) writes:

>... includes comments by Graph Theory experts ...
>suspect a hole in the arguments which reduce the problem.... This kind of
>thing goes on all the time in math, and doesn't differentiate the
>FCT from most other spectacular conjecture resolutions.


True enough, however my interest is in the fact that a computer program is
involved. In the philosophical sense, has FCT been `proven' if it has an
`unproven' computer program in the middle?

-- 
===============================================================================
Steve (really "D. E.") Stevenson           steve@hubcap.clemson.edu
Department of Computer Science,            (803)656-5880.mabell
Clemson University, Clemson, SC 29634-1906