From: MoeBlee on
Peter Olcott wrote:
> What is the
> official precise English language conclusion drawn from the results of the
> mathematical analysis of the Halting Problem?

Why not start by at least informing yourself of an exact mathematical
statement of the theorem and its proof?

MoeBlee

From: Peter Olcott on

"MoeBlee" <jazzmobe(a)hotmail.com> wrote in message
news:1161210790.800534.60930(a)h48g2000cwc.googlegroups.com...
> Peter Olcott wrote:
>> What is the
>> official precise English language conclusion drawn from the results of the
>> mathematical analysis of the Halting Problem?
>
> Why not start by at least informing yourself of an exact mathematical
> statement of the theorem and its proof?
>
> MoeBlee
>

That is not within my purpose. My purpose is to show that the Halting Problem is
really nothing more than an ill-formed question.


From: Jack Campin - bogus address on
"Peter Olcott" <NoSpam(a)SeeScreen.com> wrote:
> The Halting Problem too, is merely an ill-formed question, nothing more,
> and nothing less.

How do you deal with the fact that the halting problem for some kinds of
computation *is* solvable? That's what complexity analysis is about.
Any time you make a database query, it will have gone through an optimizer
that solves the halting problem for the database query language (and does
considerably more than that). There is nothing at all ill-formed about
asking how long it will take to get an answer.

This works because database query languages can't do as much as Turing
machines or unbounded-memory abstract machines programmed in C can. Read
a book and you might see what the relevant difference is.

============== j-c ====== @ ====== purr . demon . co . uk ==============
Jack Campin: 11 Third St, Newtongrange EH22 4PU, Scotland | tel 0131 660 4760
<http://www.purr.demon.co.uk/jack/> for CD-ROMs and free | fax 0870 0554 975
stuff: Scottish music, food intolerance, & Mac logic fonts | mob 07800 739 557
From: MoeBlee on
Peter Olcott wrote:
> "MoeBlee" <jazzmobe(a)hotmail.com> wrote in message
> news:1161210790.800534.60930(a)h48g2000cwc.googlegroups.com...
> > Peter Olcott wrote:
> >> What is the
> >> official precise English language conclusion drawn from the results of the
> >> mathematical analysis of the Halting Problem?
> >
> > Why not start by at least informing yourself of an exact mathematical
> > statement of the theorem and its proof?
> >
> > MoeBlee
> >
>
> That is not within my purpose. My purpose is to show that the Halting Problem is
> really nothing more than an ill-formed question.

You know it's ill-formed but you don't know anything about the actual
math of it. Right. Gotcha.

MoeBlee

From: Ben Bacarisse on
"Peter Olcott" <NoSpam(a)SeeScreen.com> writes:

> "Ben Bacarisse" <ben.usenet(a)bsb.me.uk> wrote in message
> news:87wt6x8yc2.fsf(a)bsb.me.uk...
>> "Peter Olcott" <NoSpam(a)SeeScreen.com> writes:
>>
>>> "Ben Bacarisse" <ben.usenet(a)bsb.me.uk> wrote in message
>>> news:87lkneqm4p.fsf(a)bsb.me.uk...
>>>> "Peter Olcott" <NoSpam(a)SeeScreen.com> writes:
>>>>
>> <big snip>
>>>>>>>>>
>>>>>>>>> http://www.cprogramming.com/tutorial/computersciencetheory/halting.html
>>> Explain this proof within the context of the model that I provided.
>>
>> No thanks. More formal methods are the only way to avoid these vague,
>> hand-waving arguments.
>>
>
> Or perhaps they are a way to make a model that only seems to
> correspond to the actuality, with slight errors of the precise
> mathematical mapping, thus creating the fallacy of equivocation.

Perhaps. How will you ever know? When someone says something that
"sounds reasonable"? That was the point of my asking the questions you
did not answer. I am genuinely curious to know if you really think
your vague words will persuade anyone here to change his/her mind and what
kind of thing anyone here might say that would cause you to doubt your
arguments. I suspect that you don't really think anyone will be
persuaded and that you are just enjoying a good troll.

PS. Please stop quoting sigs. A biot of snipping would not go amiss
either.

--
Ben.