Re: Halting Problem: Give up

From: Kent Paul Dolan (xanthian_at_well.com)
Date: 08/10/04 

Date: Tue, 10 Aug 2004 04:41:58 +0000 (UTC)

It's unlikely that I've counted right, but roughly,
including this posting, Peter Olcott has now wasted
1646 news articles in comp.theory.

Despite all of those articles he has convinced no
one but himself that he is correct.

During all of that conversation he has failed to
understand Turing Machines, the Halting Problem, the
tools used in studying it, or the long established
disproof that a general purpose Halting Problem
Solver can exist.

>From all the responses to his postings, though
dozens of refutations of his nonsense have been
written by competent commentators, he has not
recognized a single counter to his arguments which
he is capable of understanding past his obsession,
much less the many, many refutations that have been
presented which all competent commentators recognize
as sufficing.

>From all of the invested time and energy of others
he has learned competence in none of logical
thinking, computer theory, mathematical proofs, nor
proof by contradiction, nor does he show any signs
of seeking to gain such competence.

It very likely _is_ long past time to recognize
Peter Olcott: recognize him as an invincible
ignorant person, as a Usenet Kook of the First
Water, with Silver Clusters, and as a time wasting
moron of the kind with whom Scott Adams' "Dilbert"
tells us always to postpone meetings.

In the interests of leaving attention to be
available for computer theory subjects of greater
interest even if less shrill proponents, I suggest
that it is time to declare that Peter Olcott has
used up his 15 minutes of fame, and needs ignoring
by _everyone_ henceforth, and that we should all
postpone our future meetings with him by failing to
read his valueless postings, the fast track to
failing to answer them.

xanthian. 

-- 
Posted via Mailgate.ORG Server - http://www.Mailgate.ORG

Relevant Pages

  • Re: Halting Problem: Give up
    ... including this posting, ... 1646 news articles in comp.theory. ... presented which all competent commentators recognize ... Peter Olcott: ...
    (comp.theory)
  • Re: [PO] Re: Can a regular Turing Machine provide Protected Memory?
    ... > Peter Olcott wrote: ... >> my highest priority because he claims to be a PhD computer science ... >> the methods to test his basis on this method. ... No I just changed my mind with respect to that one posting. ...
    (comp.theory)
  • Re: [PO] Re: Can a regular Turing Machine provide Protected Memory?
    ... > Peter Olcott wrote: ... >> my highest priority because he claims to be a PhD computer science ... >> the methods to test his basis on this method. ... No I just changed my mind with respect to that one posting. ...
    (sci.logic)
  • Re: Halting Problem: Give up
    ... > including this posting, Peter Olcott has now wasted ... In sci.logic we are USED to this sort of thing. ... that people replying from other fora can do is make ...
    (sci.logic)