home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!usc!zaphod.mps.ohio-state.edu!uwm.edu!ogicse!das-news.harvard.edu!husc-news.harvard.edu!husc10.harvard.edu!zeleny
- From: zeleny@husc10.harvard.edu (Michael Zeleny)
- Newsgroups: sci.logic
- Subject: Re: Logic and Mathematicians
- Message-ID: <1992Nov19.230948.17624@husc3.harvard.edu>
- Date: 20 Nov 92 04:09:47 GMT
- Article-I.D.: husc3.1992Nov19.230948.17624
- References: <1992Nov15.191744.17481@husc3.harvard.edu> <1992Nov16.222220.7956@dorsai.com> <56452@dime.cs.umass.edu>
- Organization: The Phallogocentric Cabal
- Lines: 29
- Nntp-Posting-Host: husc10.harvard.edu
-
- In article <56452@dime.cs.umass.edu>
- yodaiken@chelm.cs.umass.edu (victor yodaiken) writes:
-
- >In article <1992Nov16.222220.7956@dorsai.com>
- >mutation@dorsai.com (Florian Lengyel) writes:
-
- FL:
- >>If you believe the polynomial-time version of Church's thesis, this situation
- >>cannot occur (assuming that polynomial-time means the same thing in both
- >>models).
-
- VY:
- >What's the polynomial-time version of Church's thesis? Note that
- >a computation requiring Ackermann(1000,1000)+n steps can be carried out
- >in linear time, but is surely not feasably computable.
-
- Victor, you old ne-plus-ultra-intuitionist, you took the words right
- out of my mouth. Florian, I have no idea what you are talking about.
- None of the treatments of Church's thesis known to me seem to shed any
- light on your use of the term. This is not just a matter of feasible
- computability being demonstrably different in its extension from
- polynomial-time computability, but that of the dubious relevance of
- issues of complexity to the matter at hand.
-
- >yodaiken@chelm.cs.umass.edu
-
- cordially,
- mikhail zeleny@husc.harvard.edu
- "Le cul des femmes est monotone comme l'esprit des hommes."
-