Path: ...!wn13feed!worldnet.att.net!bgtnsc04-news.ops.worldnet.att.net.POSTED!53ab2750!not-for-mail
From: "Peter Olcott" <olcott@worldnet.att.net>
Newsgroups: sci.logic
Subject: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)
Lines: 26
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2800.1409
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1409
Message-ID: <kZiBc.103407$Gx4.18142@bgtnsc04-news.ops.worldnet.att.net>
Date: Sun, 20 Jun 2004 16:31:12 GMT
NNTP-Posting-Host: 12.73.110.218
X-Complaints-To: abuse@worldnet.att.net
X-Trace: bgtnsc04-news.ops.worldnet.att.net 1087749072 12.73.110.218 (Sun, 20 Jun 2004 16:31:12 GMT)
NNTP-Posting-Date: Sun, 20 Jun 2004 16:31:12 GMT
Organization: AT&T Worldnet

Below is the link from which I am basing my discussion.
http://www.netaxs.com/people/nerp/automata/halting2.html

Because of all of the dialogue of the other threads on this
subject I am able to state my position much more clearly.
Below is the best example yet of the proof of my point.

PREMISES:
(1) The Halting Problem was specified in  such a way that a solution
was defined to be impossible.

(2) The set of questions that are defined to not have any possible
correct answer(s) forms a proper subset of all possible questions.

(3) Some questions that belong to this set are ill-formed.
      (Example: What are the colors of the flag of the United States
      of America in dollars and cents?)

(4) All the questions of this set have analogous properties such that
if one question of this set is ill-formed, then all questions of this set
are ill-formed.

CONCLUSION:
Therefore the Halting Problem is an ill-formed question.