Math Forum / Mathematics / Mathematical Logic / August 2004

www.halting-proiblem.com
I want to make what I am saying as clear as possible. If anyone
has any points that are still not clear, this is the thread to ask for
clarifications.

Many of the attempts at refuting my refutation of the Halting Problem
implicitly assumed that the answer to this question is no. They try to
prove that my refutation is wrong by making this false assumption.
Instead of keeping this false assumption hidden under the cover of

I'm new. May I join the group?
Greetings
--
Robert Trypuz

Nothing exists, means, It is not the case that something exists.
(Nothing exists) <-> ~(Something exists)
Something exists <-> ~(Nothing exists)
Something exists, means, there is an x such that: x exists.

Funny fortune() cookie to have show up while I'm
discussing Peter Olcott:
<quote>
If you can believe ten impossible things before

OK, before we get started with the meat of this, we need to agree on
some definitions, so here we go:
Definition: The "Halting Problem" is a problem which takes two inputs
(machine,input), where "machine" is a description of a Turing Machine

I have recently read a few papers, web pages, and parts of a text on
nonmonotonic logic, Answer Set programming, and AnsProlog in
particular.  I find it interesting that nobody addresses the issue of
Godel's incompleteness theorems because these "logics" force

http://no-terror.wirewalk.com/
That is one good website. Whoever put it up, thanks, that site is
really needed to wake people up.
Read also the part about Dave Touretzky, on

I'm looking for an example of a complete but undecidable
theory.
But complete I mean that every sentence in the theory
may be proved to be true or to be false. By decidable I

I'm trying to understand Godel's universe of constructible sets as well
as I can.   I understand that they are indexed by ordinals, and that
at each stage we collect up those definable in the specified way from
the earlier stages.

Please trim all cross posts to other groups besides
comp.theory, and sci.logic.  Thank you

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:W2yWc.505833$Gx4.12693@bgtnsc04-news.ops.worldnet.att.net...

What logics are used by Creative Music Synth [220]?

It appears in para 10 Examples of large classes of numbers which are
computable
[Page 256, under theorem (v)]
"

I am grateful to William Elliot (WE) for his observation
concerning positive grammars with no empty productions.
When WE suggesting replacing the production rule Z -> z e
with the rule Z -> e to terminate the derivation, I realized