home *** CD-ROM | disk | FTP | other *** search
- Path: soap.news.pipex.net!pipex!usenet
- From: m.hendry@dial.pipex.com (Mathew Hendry)
- Newsgroups: comp.sys.amiga.programmer
- Subject: Re: 680X0 -> PPC translator?
- Date: Wed, 17 Apr 96 18:42:43
- Organization: Private node.
- Distribution: world
- Message-ID: <19960417.4030F8.10F7A@al055.du.pipex.com>
- References: <31499F8E.26A9@netvision.net.il> <volker.0fw1@vb.franken.de> <19960408.40F118.E8F9@an052.du.pipex.com> <316BD11F.69A7@netvision.net.il> <19960410.413918.CA24@aj158.du.pipex.com> <316FE1A5.3A1F@netvision.net.il> <19960413.4A71D0.E501@an089.du.pipex.com> <3174A593.5045@sapiens.com>
- NNTP-Posting-Host: al055.du.pipex.com
- X-Newsreader: TIN [AMIGA 1.3 950726BETA PL0]
-
- Avi L. (avil@sapiens.com) wrote:
- : please stick to reality and in reality you're wrong until proven otherwise.
-
- Sorry, it's the other way around. I (and several other people) have pointed
- you towards direct mathematical proof that the problem is insoluble _in the
- general case_. In other words, there are exceptions to any set of rules which
- you may come up with. Until YOU provide proof that your rules will only be
- applied to problems which do not fall into the "exceptions" category for those
- particular rules, your algorithms must be considered unreliable for their
- purpose.
-
- It is pointless to continue this argument until you do so, because you seem
- unwilling (or unable) to consider anything which contradicts your own claims.
- Specifically, I doubt very much that you have studied Turing's original
- results or any later work on computability / complexity theory. I suspect that
- there is an element of fear involved here, given the increasingly paranoid
- nature of your posts.
-
- -- Mat.
-