home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!cis.ohio-state.edu!magnus.acs.ohio-state.edu!wjcastre
- From: wjcastre@magnus.acs.ohio-state.edu (W.Jose Castrellon G.)
- Subject: Proofs from a finite number of examples (was RE: marrying ages)
- Message-ID: <1992Aug13.014926.29386@magnus.acs.ohio-state.edu>
- Sender: news@magnus.acs.ohio-state.edu
- Nntp-Posting-Host: bottom.magnus.acs.ohio-state.edu
- Organization: The Ohio State University,Math.Dept.(studnt)
- References: <hubert.713379330@spica> <55Z55ZP@math.fu-berlin.de>
- Date: Thu, 13 Aug 1992 01:49:26 GMT
- Lines: 14
-
- In article <55Z55ZP@math.fu-berlin.de> guckes@math.fu-berlin.de (Sven Guckes) writes:
- ...
- [original article deleted]
- ...
- >
- >If he uses four examples to prove his statement - tell him to quit math!
- >
-
- Maybe not...once I came across a paper by Chaitin (I dont have the reference
- at hand, sorry) where he writes about the busy beaver function and the
- implications that the knowledge of some of its values would bring: if FLT is
- true, then it would follow from the proofs for exponents n, 2 < n < a, for
- some fixed a; same for other diophantine equations and various long standing
- conjectures. As you might know, busy beaver is non-computable.
-