Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.logic > #165190 > unrolled thread

When will the establishment see the light?

Started byNewberry <newberryxy@gmail.com>
First post2017-10-16 21:55 -0700
Last post2017-10-17 21:04 -0500
Articles 16 — 5 participants

Back to article view | Back to sci.logic


Contents

  When will the establishment see the light? Newberry <newberryxy@gmail.com> - 2017-10-16 21:55 -0700
    Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-17 16:40 +0100
      Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-17 12:13 -0700
        Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-18 00:43 +0100
          Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-17 18:28 -0700
            Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-18 15:52 +0100
              Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-18 21:16 -0700
                Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-19 18:03 +0100
                  Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-19 17:50 -0700
                    Re: When will the establishment see the light? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-10-20 11:44 +0100
                      Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-20 10:02 -0700
        Re: When will the establishment see the light? Julio Di Egidio <julio@diegidio.name> - 2017-10-20 11:42 -0700
          Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-20 12:27 -0700
            Re: When will the establishment see the light? Julio Di Egidio <julio@diegidio.name> - 2017-10-20 12:45 -0700
              Re: When will the establishment see the light? khongdongphong@gmail.com - 2017-10-20 12:50 -0700
    Re: When will the establishment see the light? "Shobe, Martin" <martin.shobe@yahoo.com> - 2017-10-17 21:04 -0500

#165190 — When will the establishment see the light?

FromNewberry <newberryxy@gmail.com>
Date2017-10-16 21:55 -0700
SubjectWhen will the establishment see the light?
Message-ID<os42gh$drf$1@dont-email.me>
When will the establishment see the light? I claim the existence of a 
sound and consistent partial halting decider that returns “yes” or “no” 
[or nothing], and is in a certain sense able to identify the cases it 
cannot decide. What is this “certain sense”? The Halting Theorem is 
usually proven by constructing a self-referential “counterexample”, a 
program that attempts to say that it itself does not halt. I claim the 
existence of a program that is able to determine that its own attempt to 
determine (that the counterexample does not halt) does not halt.

I do not know if anyone can actually deny the existence such a program 
because I have a simple example running. 
http://xnewberry.tripod.com/ProvableNotProvableNotHalt.c The question is 
if the program contradicts itself. I am suggesting that it does not.

https://www.researchgate.net/publication/316562253_Getting_around_the_Halting_Problem

[toc] | [next] | [standalone]


#165225

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-10-17 16:40 +0100
Message-ID<87r2u13hr2.fsf@bsb.me.uk>
In reply to#165190
Newberry <newberryxy@gmail.com> writes:

> When will the establishment see the light?

When you publish a paper in journal read by "the establishment"
(provided the paper is, in fact, enlightening).  Whoever "the
establishment" are, they almost certainly don't read this crank-infested
corner of Usenet.

> I claim the existence of a sound and consistent partial halting
> decider that returns “yes” or “no” [or nothing], and is in a certain
> sense able to identify the cases it cannot decide.  What is this
> “certain sense”? The Halting Theorem is usually proven by constructing
> a self-referential “counterexample”, a program that attempts to say
> that it itself does not halt. I claim the existence of a program that
> is able to determine that its own attempt to determine (that the
> counterexample does not halt) does not halt.

See Rice's theorem.  If you have a counter-example, that will get
published like a shot, and you will be famous.

> I do not know if anyone can actually deny the existence such a program
> because I have a simple example
> running. http://xnewberry.tripod.com/ProvableNotProvableNotHalt.c The
> question is if the program contradicts itself. I am suggesting that it
> does not.

The existence of partial halting deciders is trivial.  The existence of
a program that can determine any non-trivial property of the language of
a TM (such as the one you describe as determining "a certain sense")
would be headline news.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#165228

Fromkhongdongphong@gmail.com
Date2017-10-17 12:13 -0700
Message-ID<9c8434af-6ea4-4ff0-abd9-ad72fe2f192f@googlegroups.com>
In reply to#165225
On Tuesday, 17 October 2017 09:40:24 UTC-6, Ben Bacarisse  wrote:
> Newberry <newberryxy@gmail.com> writes:
> 
> > When will the establishment see the light?
> 
> When you publish a paper in journal read by "the establishment"
> (provided the paper is, in fact, enlightening).  Whoever "the
> establishment" are, they almost certainly don't read this crank-infested
> corner of Usenet.
> 
> > I claim the existence of a sound and consistent partial halting
> > decider that returns “yes” or “no” [or nothing], and is in a certain
> > sense able to identify the cases it cannot decide.  What is this
> > “certain sense”? The Halting Theorem is usually proven by constructing
> > a self-referential “counterexample”, a program that attempts to say
> > that it itself does not halt. I claim the existence of a program that
> > is able to determine that its own attempt to determine (that the
> > counterexample does not halt) does not halt.
> 
> See Rice's theorem.  If you have a counter-example, that will get
> published like a shot, and you will be famous.
> 
> > I do not know if anyone can actually deny the existence such a program
> > because I have a simple example
> > running. http://xnewberry.tripod.com/ProvableNotProvableNotHalt.c The
> > question is if the program contradicts itself. I am suggesting that it
> > does not.
> 
> The existence of partial halting deciders is trivial.  The existence of
> a program that can determine any non-trivial property of the language of
> a TM (such as the one you describe as determining "a certain sense")
> would be headline news.

In your opinion would "It's impossible to know or verify that the Goldbach
Conjecture is true if it is so" a headline to the "Establishment" and mathematical
community?

[toc] | [prev] | [next] | [standalone]


#165236

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-10-18 00:43 +0100
Message-ID<878tg92vdh.fsf@bsb.me.uk>
In reply to#165228
khongdongphong@gmail.com writes:
<snip>
> In your opinion would "It's impossible to know or verify that the
> Goldbach Conjecture is true if it is so" a headline to the
> "Establishment" and mathematical community?

Don't hijack threads.  You have plenty containing your own inane
nonsense.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#165239

Fromkhongdongphong@gmail.com
Date2017-10-17 18:28 -0700
Message-ID<67758eb0-af3c-4867-816e-cde3aac47b12@googlegroups.com>
In reply to#165236
On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
> khongdongphong@gmail.com writes:
> <snip>
> > In your opinion would "It's impossible to know or verify that the
> > Goldbach Conjecture is true if it is so" a headline to the
> > "Establishment" and mathematical community?
> 
> Don't hijack threads.  You have plenty containing your own inane
> nonsense.

Don't lie. 

Don't be afraid about hijacking possibility: it was (is) just a simple
question about the interest out there about century old Conjecture. And
don't worry about the nonsense: nobody can technically prove it has existed.
(Just some imagination the way it has been).

Do you think "It's impossible to know or verify that the Goldbach Conjecture
is true if it is so" would be a headline, an interest to the "Establishment"
and mathematical community?

[toc] | [prev] | [next] | [standalone]


#165269

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-10-18 15:52 +0100
Message-ID<87a80ov78l.fsf@bsb.me.uk>
In reply to#165239
khongdongphong@gmail.com writes:

> On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
>> khongdongphong@gmail.com writes:
>> <snip>
>> > In your opinion would "It's impossible to know or verify that the
>> > Goldbach Conjecture is true if it is so" a headline to the
>> > "Establishment" and mathematical community?
>> 
>> Don't hijack threads.  You have plenty containing your own inane
>> nonsense.
>
> Don't lie.

Which bit do you think is a lie?  The number of threads of yours is
beyond question and you can't think I don't honestly believe they
contain inane nonsense.

<snip>
> Do you think "It's impossible to know or verify that the Goldbach Conjecture
> is true if it is so" would be a headline, an interest to the "Establishment"
> and mathematical community?

You don't have anything interesting to say about that conjecture.  You
have "decided" not to publish so I don't think even you believe you have
anything interesting to say about it.  You just like going on about it
here because that makes you think people are taking you seriously.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#165299

Fromkhongdongphong@gmail.com
Date2017-10-18 21:16 -0700
Message-ID<e5fc52ff-955f-4581-80b8-3ae811760338@googlegroups.com>
In reply to#165269
On Wednesday, 18 October 2017 08:52:13 UTC-6, Ben Bacarisse  wrote:
> khongdongphong@gmail.com writes:
> 
> > On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
> >> khongdongphong@gmail.com writes:
> >> <snip>
> >> > In your opinion would "It's impossible to know or verify that the
> >> > Goldbach Conjecture is true if it is so" a headline to the
> >> > "Establishment" and mathematical community?
> >> 
> >> Don't hijack threads.  You have plenty containing your own inane
> >> nonsense.
> >
> > Don't lie.
> 
> Which bit do you think is a lie?

The bits that you didn't tell the truth, didn't have concrete evidence
when making your incorrect, venomous Inquisition accusations.

[toc] | [prev] | [next] | [standalone]


#165318

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-10-19 18:03 +0100
Message-ID<87k1zrqdcy.fsf@bsb.me.uk>
In reply to#165299
khongdongphong@gmail.com writes:

> On Wednesday, 18 October 2017 08:52:13 UTC-6, Ben Bacarisse  wrote:
>> khongdongphong@gmail.com writes:
>> 
>> > On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
>> >> khongdongphong@gmail.com writes:
>> >> <snip>
>> >> > In your opinion would "It's impossible to know or verify that the
>> >> > Goldbach Conjecture is true if it is so" a headline to the
>> >> > "Establishment" and mathematical community?
>> >> 
>> >> Don't hijack threads.  You have plenty containing your own inane
>> >> nonsense.
>> >
>> > Don't lie.
>> 
>> Which bit do you think is a lie?
>
> The bits that you didn't tell the truth, didn't have concrete evidence
> when making your incorrect, venomous Inquisition accusations.

Odd that you won't even answer non-technical questions.  Anyway, never
mind -- I was just curious.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#165335

Fromkhongdongphong@gmail.com
Date2017-10-19 17:50 -0700
Message-ID<c342ea5b-8fc9-4fbe-8cc4-a8a62d9c915e@googlegroups.com>
In reply to#165318
On Thursday, 19 October 2017 11:03:28 UTC-6, Ben Bacarisse  wrote:
> khongdongphong@gmail.com writes:
> 
> > On Wednesday, 18 October 2017 08:52:13 UTC-6, Ben Bacarisse  wrote:
> >> khongdongphong@gmail.com writes:
> >> 
> >> > On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
> >> >> khongdongphong@gmail.com writes:
> >> >> <snip>
> >> >> > In your opinion would "It's impossible to know or verify that the
> >> >> > Goldbach Conjecture is true if it is so" a headline to the
> >> >> > "Establishment" and mathematical community?
> >> >> 
> >> >> Don't hijack threads.  You have plenty containing your own inane
> >> >> nonsense.
> >> >
> >> > Don't lie.
> >> 
> >> Which bit do you think is a lie?
> >
> > The bits that you didn't tell the truth, didn't have concrete evidence
> > when making your incorrect, venomous Inquisition accusations.
> 
> Odd that you won't even answer non-technical questions.  Anyway, never
> mind -- I was just curious.

Odd that you didn't even answer a non-technical question in:

https://groups.google.com/d/msg/sci.logic/4zD4QR2uTLw/bBScq1p5AgAJ

But any rate, I'm not surprised; I was just curious if you'd have some
- or ZERO - interest about the multi-century old outstanding Conjecture.

[toc] | [prev] | [next] | [standalone]


#165363

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-10-20 11:44 +0100
Message-ID<87vajap08f.fsf@bsb.me.uk>
In reply to#165335
khongdongphong@gmail.com writes:

> On Thursday, 19 October 2017 11:03:28 UTC-6, Ben Bacarisse  wrote:
>> khongdongphong@gmail.com writes:
>> 
>> > On Wednesday, 18 October 2017 08:52:13 UTC-6, Ben Bacarisse  wrote:
>> >> khongdongphong@gmail.com writes:
>> >> 
>> >> > On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
>> >> >> khongdongphong@gmail.com writes:
>> >> >> <snip>
>> >> >> > In your opinion would "It's impossible to know or verify that the
>> >> >> > Goldbach Conjecture is true if it is so" a headline to the
>> >> >> > "Establishment" and mathematical community?
>> >> >> 
>> >> >> Don't hijack threads.  You have plenty containing your own inane
>> >> >> nonsense.
>> >> >
>> >> > Don't lie.
>> >> 
>> >> Which bit do you think is a lie?
>> >
>> > The bits that you didn't tell the truth, didn't have concrete evidence
>> > when making your incorrect, venomous Inquisition accusations.
>> 
>> Odd that you won't even answer non-technical questions.  Anyway, never
>> mind -- I was just curious.
>
> Odd that you didn't even answer a non-technical question in:
>
> https://groups.google.com/d/msg/sci.logic/4zD4QR2uTLw/bBScq1p5AgAJ

No, it's not odd.  That's called a rhetorical question.

> But any rate, I'm not surprised; I was just curious if you'd have some
> - or ZERO - interest about the multi-century old outstanding
> Conjecture.

No you weren't.  You wanted someone to talk to you.  It worked.  Be happy.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#165384

Fromkhongdongphong@gmail.com
Date2017-10-20 10:02 -0700
Message-ID<927c0233-df4d-42e9-a312-6552e9f005e7@googlegroups.com>
In reply to#165363
On Friday, 20 October 2017 04:44:34 UTC-6, Ben Bacarisse  wrote:
> khongdongphong@gmail.com writes:
> 
> > On Thursday, 19 October 2017 11:03:28 UTC-6, Ben Bacarisse  wrote:
> >> khongdongphong@gmail.com writes:
> >> 
> >> > On Wednesday, 18 October 2017 08:52:13 UTC-6, Ben Bacarisse  wrote:
> >> >> khongdongphong@gmail.com writes:
> >> >> 
> >> >> > On Tuesday, 17 October 2017 17:43:41 UTC-6, Ben Bacarisse  wrote:
> >> >> >> khongdongphong@gmail.com writes:
> >> >> >> <snip>
> >> >> >> > In your opinion would "It's impossible to know or verify that the
> >> >> >> > Goldbach Conjecture is true if it is so" a headline to the
> >> >> >> > "Establishment" and mathematical community?
> >> >> >> 
> >> >> >> Don't hijack threads.  You have plenty containing your own inane
> >> >> >> nonsense.
> >> >> >
> >> >> > Don't lie.
> >> >> 
> >> >> Which bit do you think is a lie?
> >> >
> >> > The bits that you didn't tell the truth, didn't have concrete evidence
> >> > when making your incorrect, venomous Inquisition accusations.
> >> 
> >> Odd that you won't even answer non-technical questions.  Anyway, never
> >> mind -- I was just curious.
> >
> > Odd that you didn't even answer a non-technical question in:
> >
> > https://groups.google.com/d/msg/sci.logic/4zD4QR2uTLw/bBScq1p5AgAJ
> 
> No, it's not odd.  That's called a rhetorical question.

Yes it's odd. That's called an intellectual question.


> No you weren't.  You wanted someone to talk to you.  It worked.  Be happy.

Wrong. Even you're a proof that modern day intellectual Inquisition is very
much alive, I still want to hear (not talk to) from you and them what your
intellectual interest of the out standing Goldbach conjecture be. It failed
to work.

Go on and be happy being modern day Inquisitor.

[toc] | [prev] | [next] | [standalone]


#165396

FromJulio Di Egidio <julio@diegidio.name>
Date2017-10-20 11:42 -0700
Message-ID<93411d6a-22cf-4c90-b49a-7a5e8860d507@googlegroups.com>
In reply to#165228
On Tuesday, October 17, 2017 at 9:13:31 PM UTC+2, khongdo...@gmail.com wrote:

> In your opinion would "It's impossible to know or verify that the Goldbach
> Conjecture is true if it is so" [be] a headline to the "Establishment" and
> mathematical community?

I'd ask what "impossible to know or verify" means as it's already ambiguous:
do you mean undecidable?  In ZFC?  And even if you had a proof that it is,
which you do not have, you are indeed just hijacking yet another thread.
Please open a new thread where you state your theorem properly and possibly
give a proof.  It might not be the news of the century but I hope that
possibility will not stop you from submitting some mathematics.

In the meantime, I'd kindly invite you not to post here (about that).
(And others not to reply to further posts of this kind should you decide
to rather insist.)

Julio

[toc] | [prev] | [next] | [standalone]


#165399

Fromkhongdongphong@gmail.com
Date2017-10-20 12:27 -0700
Message-ID<b7e988ae-6964-4fa8-8638-16414355216e@googlegroups.com>
In reply to#165396
On Friday, 20 October 2017 12:42:24 UTC-6, Julio Di Egidio  wrote:
> On Tuesday, October 17, 2017 at 9:13:31 PM UTC+2, khongdo...@gmail.com wrote:
> 
> > In your opinion would "It's impossible to know or verify that the Goldbach
> > Conjecture is true if it is so" [be] a headline to the "Establishment" and
> > mathematical community?
> 
> I'd ask what "impossible to know or verify" means as it's already ambiguous:
> do you mean undecidable?  In ZFC?  And even if you had a proof that it is,
> which you do not have, you are indeed just hijacking yet another thread.
> Please open a new thread where you state your theorem properly and possibly
> give a proof.  It might not be the news of the century but I hope that
> possibility will not stop you from submitting some mathematics.
> 
> In the meantime, I'd kindly invite you not to post here (about that).
> (And others not to reply to further posts of this kind should you decide
> to rather insist.)
> 
> Julio

Your post is of a mistaken nature.

First the thread's title is "When will the establishment see the light?"
so I asked BB a question about "see the light" him being recognized as a
part of the "establishment".

Instead of launching, prolonging character assassination on the poster (NN)
presenting the question, BB could have directly answered it as a
intellectual technical question, or decided not to answer _at all_ :
he chose the former (character assassination). The word "hijacking" wouldn't
be mentioned by him in the first place. So no, I haven't hijacked this
thread.


Secondly, on the technical issue you've raised about the ambiguity of
"impossible to know or verify", if I had asked _instead_ :

 "It's impossible to know or verify that the Goldbach Conjecture is _NOT_
  true if it is so" [be] a headline to the 'Establishment' and mathematical
  community?"

I'm almost certain BB, you, or anyone else would flat answer NO: it's _not_
_impossible to know or verify it so_ .

See. Why would you or BB treat the sense "impossible to know or verify"
differently in two similar contexts?

[For the record, there was mentioned such a term as "Absolute
undecidability" in the past. Never mind whether or not you or BB could
prove it true, would you both understand its meaning?]

Anyway, my original question is genuine appropriate in this thread. One or
BB should (or should have) just answer it or stay silent and there's no
perceived "hijacking". 

Indeed, the op is Newberry and BB has hijacked this thread to further his
character assassination on NN. BB is the hijacker here.

[toc] | [prev] | [next] | [standalone]


#165401

FromJulio Di Egidio <julio@diegidio.name>
Date2017-10-20 12:45 -0700
Message-ID<089cc697-c1ef-4a27-a97f-c8d2972d207f@googlegroups.com>
In reply to#165399
On Friday, October 20, 2017 at 9:27:02 PM UTC+2, khongdo...@gmail.com wrote:
> On Friday, 20 October 2017 12:42:24 UTC-6, Julio Di Egidio  wrote:
<snip>
> > In the meantime, I'd kindly invite you not to post here (about that).
> > (And others not to reply to further posts of this kind should you decide
> > to rather insist.)
> 
> Your post is of a mistaken nature.

You think so, yet Newberry himself has complained with you several times
for hijacking his threads.  Take note: please understand that this is a
thread about *his* theory, whatever the title.

> Secondly, on the technical issue you've raised about the ambiguity of
> "impossible to know or verify", if I had asked _instead_ :

You just confirm that to direct question you never will answer...
Which is enough reason already to simply ignore you.

(EOD.)

Julio

[toc] | [prev] | [next] | [standalone]


#165403

Fromkhongdongphong@gmail.com
Date2017-10-20 12:50 -0700
Message-ID<0ce8bd84-5e24-4160-b6a6-72870ff260e7@googlegroups.com>
In reply to#165401
On Friday, 20 October 2017 13:46:00 UTC-6, Julio Di Egidio  wrote:
> On Friday, October 20, 2017 at 9:27:02 PM UTC+2, khongdo...@gmail.com wrote:
> > On Friday, 20 October 2017 12:42:24 UTC-6, Julio Di Egidio  wrote:
> <snip>
> > > In the meantime, I'd kindly invite you not to post here (about that).
> > > (And others not to reply to further posts of this kind should you decide
> > > to rather insist.)
> > 
> > Your post is of a mistaken nature.
> 
> You think so, yet Newberry himself has complained with you several times
> for hijacking his threads.  Take note: please understand that this is a
> thread about *his* theory, whatever the title.
> 
> > Secondly, on the technical issue you've raised about the ambiguity of
> > "impossible to know or verify", if I had asked _instead_ :
> 
> You just confirm that to direct question you never will answer...
> Which is enough reason already to simply ignore you.
> 
> (EOD.)
> 
> Julio

You're trolling.

[toc] | [prev] | [next] | [standalone]


#165242

From"Shobe, Martin" <martin.shobe@yahoo.com>
Date2017-10-17 21:04 -0500
Message-ID<os6cs6$hqg$1@dont-email.me>
In reply to#165190
On 10/16/2017 11:55 PM, Newberry wrote:
> When will the establishment see the light? 

When you shine some light where the establishment can see it.

> I claim the existence of a 
> sound and consistent partial halting decider that returns “yes” or “no” 
> [or nothing], and is in a certain sense able to identify the cases it 
> cannot decide. What is this “certain sense”? The Halting Theorem is 
> usually proven by constructing a self-referential “counterexample”, a 
> program that attempts to say that it itself does not halt. I claim the 
> existence of a program that is able to determine that its own attempt to 
> determine (that the counterexample does not halt) does not halt.
> 
> I do not know if anyone can actually deny the existence such a program 
> because I have a simple example running. 
> http://xnewberry.tripod.com/ProvableNotProvableNotHalt.c The question is 
> if the program contradicts itself. I am suggesting that it does not.
> 
> https://www.researchgate.net/publication/316562253_Getting_around_the_Halting_Problem 
> 

Oh the errors.

1.1
	1)	Neither "sound" nor "consistent" are properties of programs.
	2)	Given the clarification, the two criteria for A(n,m) are the same.
	3)	You never get around to the A(n,m) claim.

1.2
	1)	Program A only sometimes enables you to determine when a computation 
does not halt. You, yourself admit that it doesn't later.

1.3
	1)	C_k(s) halts if and only if C_s() halts. That's how C_s() is defined.
	2)	There was never any requirement or expectation that C_k(s) would say 
something about C_s(). The only requirement is that they say the same thing.
	3)	C_s() halting implying that C_k(s) halts is not a contradiction. 
It's required by the definition of C_s().
	4)	That imagined contradiction is not a restatement of the Halting 
Theorem proof.
	5)	H expresses the premise that "C_s() halts" by halting and returning 
the value that indicates that C_s() will halt. That is, after all, the 
purpose of H.
	6)	C_s() halting does not help H express that "C_s() halts".
	7)	C_s() halting would not contradict itself.
	8)	The only way H() is allowed to indicate halting is by halting and 
returning the value that indicates halting.
	9)	The second "proof" is not a more verbose form of the first proof. 
The fourth line is wrong since it follows from C_k(s) not halting that 
C_s() also doesn't halt.
	10) 	The argument that eliminated option 1 was flawed.
	11)	The halting theorem does not say that A() cannot determine that 
C_s() does not halt.

1.4
	1)	The best way to think about H is that H is a partial decider.
	2)	Once again, the fate of R() is known. If T(r) computes nothing, then 
R() computes nothing.
	3)	Once again, C_s() halts -> C_k(s) halts is not a contradiction. 
C_s() is defined in such a way that C_s() halts <-> C_k(s) halts and you 
never establish otherwise.
	4)	You don't know whether or not it will halt. However, that doesn't 
change the fact that it either will halt at some point or not.
	5)	One possibility is to prove that it doesn't halt. In some cases, 
this is easily done.

1.5
	1)	This is not a restatement, you don't have as many requirements on H 
as you do in the body of the paper. As defined here, H is a partial 
decider. In the body of the paper, H is a partial decider
that always gets the C_n(m) halts cases correct.

1.6
	1)	The halting problem does not make a case for non-bivalent logic.

Martin Shobe

[toc] | [prev] | [standalone]


Back to top | Article view | sci.logic


csiph-web