XPost: sci.logic

On 4/28/24 3:06 PM, olcott wrote:

On 4/28/2024 1:42 PM, Richard Damon wrote:

On 4/28/24 2:23 PM, olcott wrote:

On 4/28/2024 1:18 PM, Richard Damon wrote:

On 4/28/24 1:55 PM, olcott wrote:

On 4/28/2024 12:34 PM, Richard Damon wrote:

On 4/28/24 10:15 AM, olcott wrote:

On 4/28/2024 9:00 AM, Richard Damon wrote:

On 4/28/24 9:45 AM, olcott wrote:

On 4/28/2024 8:13 AM, Richard Damon wrote:

On 4/27/24 11:45 PM, olcott wrote:

On 4/27/2024 10:31 PM, Richard Damon wrote:

On 4/27/24 10:33 PM, olcott wrote:

On 4/27/2024 9:09 PM, Richard Damon wrote:

On 4/27/24 9:54 PM, olcott wrote:

On 4/27/2024 8:39 PM, Richard Damon wrote:

On 4/27/24 8:58 PM, olcott wrote:

On 4/27/2024 7:49 PM, Richard Damon wrote:

On 4/27/24 8:17 PM, olcott wrote:

Can D simulated by H terminate normally? >>>>>>>>>>>>>>>>>>>
The x86utm operating system based on an open source >>>>>>>>>>>>>>>>>>> x86 emulator.
This system enables one C function to execute another >>>>>>>>>>>>>>>>>>> C function
in debug step mode. When H simulates D it creates a >>>>>>>>>>>>>>>>>>> separate process
context for D with its own memory, stack and virtual >>>>>>>>>>>>>>>>>>> registers. H
is able to simulate D simulating itself, thus the >>>>>>>>>>>>>>>>>>> only limit to
recursive simulations is RAM.

// The following is written in C
//
01 typedef int (*ptr)(); // pointer to int function >>>>>>>>>>>>>>>>>>> 02 int H(ptr x, ptr y)    // uses x86 emulator to >>>>>>>>>>>>>>>>>>> simulate its input
03
04 int D(ptr x)
05 {
06   int Halt_Status = H(x, x);
07   if (Halt_Status)
08     HERE: goto HERE;
09   return Halt_Status;
10 }
11
12 void main()
13 {
14   D(D);
15 }

Execution Trace
Line 14: main() invokes D(D)

keeps repeating (unless aborted)
Line 06: simulated D(D) invokes simulated H(D,D) that >>>>>>>>>>>>>>>>>>> simulates D(D)

Simulation invariant
D correctly simulated by H cannot possibly reach its >>>>>>>>>>>>>>>>>>> own line 09.

Is it dead obvious to everyone here when examining >>>>>>>>>>>>>>>>>>> the execution
trace of lines 14 and 06 above that D correctly >>>>>>>>>>>>>>>>>>> simulated by H cannot
possibly terminate normally by reaching its own line 09? >>>>>>>>>>>>>>>>>>>

Except that you fail to mention that you have admitted >>>>>>>>>>>>>>>>>> that you are NOT working on the Halting Problem, >>>>>>>>>>>>>>>>>> despite trying to use terminology similar to it, but >>>>>>>>>>>>>>>>>> having stipulated definition that are in conflict with >>>>>>>>>>>>>>>>>> computaiton theory.

Note, "keeps repeating (unless aborted)" is a >>>>>>>>>>>>>>>>>> misleading statement, as your H will ALWAYS abort this >>>>>>>>>>>>>>>>>> input, and thus it NEVER will "Keep repeating". >>>>>>>>>>>>>>>>>>
You don't like me pointing out the problem because you >>>>>>>>>>>>>>>>>> prefer to be able to LIE to people about what you are >>>>>>>>>>>>>>>>>> doing.

You work has NOTHING to do with Halting, as your H/D >>>>>>>>>>>>>>>>>> are not even turing equivalenet to their namesakes in >>>>>>>>>>>>>>>>>> the proof you like to mention.

That is the exact verbatim post and the first >>>>>>>>>>>>>>>>> respondent agreed
and immediately noticed that I was referring to the >>>>>>>>>>>>>>>>> halting problem.

So I will go with what I said, you just don't know C very >>>>>>>>>>>>>>>>> well and want to keep that hidden behind rhetoric and >>>>>>>>>>>>>>>>> denigration.

Yes, you couch it to SOUND like the halting problem, but >>>>>>>>>>>>>>>> it isn't as you have FUNDAMENTALLY CHANGED the meaning >>>>>>>>>>>>>>>> of terms.

And thus, to act like it is, just makes you a LIAR. >>>>>>>>>>>>>>>>
Halting is NOT about H being able to simulate it input >>>>>>>>>>>>>>>> to the final state. PERIOD.

I could show how it is but you prefer to believe >>>>>>>>>>>>>>> otherwise and refuse
to go through the detailed steps required.

No, you CAN'T, because you have FUNDAMENTALLY changed the >>>>>>>>>>>>>> question, sinc eyou claim that even though D(D) Halts, >>>>>>>>>>>>>> that H(D,D) is correct to say not halting.

It is not my error it is your indoctrination.

So, How is H(D,D) saying false correct if D(D) Halts?

You refuse to go through the mandatory steps.

YOU are the only one that says they are "Manditory".

That doesn't make them so for me.

YOU refuse to explain how a Halting Turing Machine can be
correctly decider as "Non-Halting".

Your "excuses" all seem to boil down to you just need to lie >>>>>>>>>> about what you are actually doing and that you refuse to even >>>>>>>>>> learn what the actual rules and language of what you are
saying you are doing are.

SInce the DEFINITION of the quesiton that H, the Halt
Decider, is to answer is if the computation describe by its >>>>>>>>>>>> input (that is D(D) ) will halt when run.

You have to hide behind obfuscation, blusgter and LIES. >>>>>>>>>>>>
Since you don't seem to know that actual meaning of the >>>>>>>>>>>> words you use, as you have even occationally admitted, it is >>>>>>>>>>>> clear who knows what they are talking about and who doesn't. >>>>>>>>>>>>
I will also point out that you have effectively admitted >>>>>>>>>>>> that your statements are unsopported as you always fail to >>>>>>>>>>>> provide actual references to accepted ground for your claims. >>>>>>>>>>>>

It is psychotic that people really believes that the >>>>>>>>>>>>>>> principle of
explosion is valid inference even though there is zero >>>>>>>>>>>>>>> doubt the it
derives the non-sequitur error.

Nope, that just means you don't understand how logic works. >>>>>>>>>>>>>>
YOU are the psychotic.

*When we encode the principle of explosion as a syllogism* >>>>>>>>>>>>>>> Socrates is a man.
Socrates is not a man.
Therefore, Socrates is a butterfly.

Nope. And that is because the principle of explosion is >>>>>>>>>>>>>> NOT a "syllogism"

You are again just proving your stupidity.

The conclusion does not follow from the premises, thus >>>>>>>>>>>>>>> the non-sequitur error.
https://en.wikipedia.org/wiki/Principle_of_explosion >>>>>>>>>>>>>>

So, which step doesn't is incorrect.

Givens:
Proposition A is True.
Proposition A is False.

The syllogism would be dead right there.
Some A are True
No A are True

So, you don't understand what the principle of explosion >>>>>>>>>>>> actually is.

Some A are True
No A are True
therefore B

Which was proven.

You are indoctrinated into believing that the non-sequitur error >>>>>>>>> is not an error. The only semantics that passes out of (A ∧ ~A) >>>>>>>>> is FALSE.

And you only get the "non-sequitur" form because The Principle >>>>>>>> of Explosion is not a Syllogism. It is a THEOREM.

All A are True
No A are True
Therefore B

(1) Is a pair of proper categorical propositions.
     https://en.wikipedia.org/wiki/Categorical_proposition
(2) That are isomorphic to the Principle of Explosion.
(3) And do form the non-sequitur error.

In simple words, you are just admitting that you are a stupid
idiot, not reading the replies and just reposting your lies.

The Principle of explosion is NOT stated as a Syllogism, because
the form of a Syllogism can't handle it,

I just proved that the syllogism DID handle it. You are trying
to get away with a dictatorial fiat rebuttal to point (2).

Then you don't understand what a Syllogism is.

It is ALWAYS a pair of statements, each relating two "terms" with
one term in common between the two statements, and the conclusion
being a relationship between the two other terms.

There you go. So when we correctly translate the POE into a
syllogism we can see that it is invalid because it never has any
relationship to the other two terms.

Which just means that the Principle of Explosion can not be reduced to
a Syllogism.

The premises of the POE proposition <ARE> isomorphic
to their categorical proposition equivalents.
The conclusion is identical thus not even translated.

Therefore the POE argument was correctly translated into
a syllogism that is invalid only because the POE argument
was invalid.

So, yes, you have translated an expression of the Principle of
Explossion into a rough Syllogism form, and found it fails to actuallly
meet the form of a Syllogism.

That doesn't mean that the Principle of Explosion is an incorrect
theorem, just that is didn't express as a Syllogism.

You saying that makes the POE to be invalid just proves that you do not understand even the BASICS of how logic works, and thus NOTHING you have
said should be considered to have any impact.

Face it, you are just burying your reputation under miles of errors and falsehoods, so no one is going to take any of your work seriously.

Which is perhaps too bad, as there may have been some idea that could
have been teased out of it that had some possible application.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: sci.logic

On 4/28/24 6:28 PM, olcott wrote:

On 4/28/2024 2:29 PM, Richard Damon wrote:

On 4/28/24 3:06 PM, olcott wrote:

On 4/28/2024 1:42 PM, Richard Damon wrote:

On 4/28/24 2:23 PM, olcott wrote:

On 4/28/2024 1:18 PM, Richard Damon wrote:

On 4/28/24 1:55 PM, olcott wrote:

On 4/28/2024 12:34 PM, Richard Damon wrote:

On 4/28/24 10:15 AM, olcott wrote:

On 4/28/2024 9:00 AM, Richard Damon wrote:

On 4/28/24 9:45 AM, olcott wrote:

On 4/28/2024 8:13 AM, Richard Damon wrote:

On 4/27/24 11:45 PM, olcott wrote:

On 4/27/2024 10:31 PM, Richard Damon wrote:

On 4/27/24 10:33 PM, olcott wrote:

On 4/27/2024 9:09 PM, Richard Damon wrote:

On 4/27/24 9:54 PM, olcott wrote:

On 4/27/2024 8:39 PM, Richard Damon wrote:

On 4/27/24 8:58 PM, olcott wrote:

On 4/27/2024 7:49 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>> On 4/27/24 8:17 PM, olcott wrote:

Can D simulated by H terminate normally? >>>>>>>>>>>>>>>>>>>>>
The x86utm operating system based on an open source >>>>>>>>>>>>>>>>>>>>> x86 emulator.
This system enables one C function to execute >>>>>>>>>>>>>>>>>>>>> another C function
in debug step mode. When H simulates D it creates a >>>>>>>>>>>>>>>>>>>>> separate process
context for D with its own memory, stack and >>>>>>>>>>>>>>>>>>>>> virtual registers. H
is able to simulate D simulating itself, thus the >>>>>>>>>>>>>>>>>>>>> only limit to
recursive simulations is RAM.

// The following is written in C
//
01 typedef int (*ptr)(); // pointer to int function >>>>>>>>>>>>>>>>>>>>> 02 int H(ptr x, ptr y)    // uses x86 emulator to >>>>>>>>>>>>>>>>>>>>> simulate its input
03
04 int D(ptr x)
05 {
06   int Halt_Status = H(x, x);
07   if (Halt_Status)
08     HERE: goto HERE;
09   return Halt_Status;
10 }
11
12 void main()
13 {
14   D(D);
15 }

Execution Trace
Line 14: main() invokes D(D)

keeps repeating (unless aborted)
Line 06: simulated D(D) invokes simulated H(D,D) >>>>>>>>>>>>>>>>>>>>> that simulates D(D)

Simulation invariant
D correctly simulated by H cannot possibly reach >>>>>>>>>>>>>>>>>>>>> its own line 09.

Is it dead obvious to everyone here when examining >>>>>>>>>>>>>>>>>>>>> the execution
trace of lines 14 and 06 above that D correctly >>>>>>>>>>>>>>>>>>>>> simulated by H cannot
possibly terminate normally by reaching its own >>>>>>>>>>>>>>>>>>>>> line 09?

Except that you fail to mention that you have >>>>>>>>>>>>>>>>>>>> admitted that you are NOT working on the Halting >>>>>>>>>>>>>>>>>>>> Problem, despite trying to use terminology similar >>>>>>>>>>>>>>>>>>>> to it, but having stipulated definition that are in >>>>>>>>>>>>>>>>>>>> conflict with computaiton theory.

Note, "keeps repeating (unless aborted)" is a >>>>>>>>>>>>>>>>>>>> misleading statement, as your H will ALWAYS abort >>>>>>>>>>>>>>>>>>>> this input, and thus it NEVER will "Keep repeating". >>>>>>>>>>>>>>>>>>>>
You don't like me pointing out the problem because >>>>>>>>>>>>>>>>>>>> you prefer to be able to LIE to people about what >>>>>>>>>>>>>>>>>>>> you are doing.

You work has NOTHING to do with Halting, as your H/D >>>>>>>>>>>>>>>>>>>> are not even turing equivalenet to their namesakes >>>>>>>>>>>>>>>>>>>> in the proof you like to mention.

That is the exact verbatim post and the first >>>>>>>>>>>>>>>>>>> respondent agreed
and immediately noticed that I was referring to the >>>>>>>>>>>>>>>>>>> halting problem.

So I will go with what I said, you just don't know C >>>>>>>>>>>>>>>>>>> very
well and want to keep that hidden behind rhetoric and >>>>>>>>>>>>>>>>>>> denigration.

Yes, you couch it to SOUND like the halting problem, >>>>>>>>>>>>>>>>>> but it isn't as you have FUNDAMENTALLY CHANGED the >>>>>>>>>>>>>>>>>> meaning of terms.

And thus, to act like it is, just makes you a LIAR. >>>>>>>>>>>>>>>>>>
Halting is NOT about H being able to simulate it input >>>>>>>>>>>>>>>>>> to the final state. PERIOD.

I could show how it is but you prefer to believe >>>>>>>>>>>>>>>>> otherwise and refuse
to go through the detailed steps required.

No, you CAN'T, because you have FUNDAMENTALLY changed >>>>>>>>>>>>>>>> the question, sinc eyou claim that even though D(D) >>>>>>>>>>>>>>>> Halts, that H(D,D) is correct to say not halting. >>>>>>>>>>>>>>>>

It is not my error it is your indoctrination.

So, How is H(D,D) saying false correct if D(D) Halts? >>>>>>>>>>>>>>

You refuse to go through the mandatory steps.

YOU are the only one that says they are "Manditory".

That doesn't make them so for me.

YOU refuse to explain how a Halting Turing Machine can be >>>>>>>>>>>> correctly decider as "Non-Halting".

Your "excuses" all seem to boil down to you just need to lie >>>>>>>>>>>> about what you are actually doing and that you refuse to >>>>>>>>>>>> even learn what the actual rules and language of what you >>>>>>>>>>>> are saying you are doing are.

SInce the DEFINITION of the quesiton that H, the Halt >>>>>>>>>>>>>> Decider, is to answer is if the computation describe by >>>>>>>>>>>>>> its input (that is D(D) ) will halt when run.

You have to hide behind obfuscation, blusgter and LIES. >>>>>>>>>>>>>>
Since you don't seem to know that actual meaning of the >>>>>>>>>>>>>> words you use, as you have even occationally admitted, it >>>>>>>>>>>>>> is clear who knows what they are talking about and who >>>>>>>>>>>>>> doesn't.

I will also point out that you have effectively admitted >>>>>>>>>>>>>> that your statements are unsopported as you always fail to >>>>>>>>>>>>>> provide actual references to accepted ground for your claims. >>>>>>>>>>>>>>

It is psychotic that people really believes that the >>>>>>>>>>>>>>>>> principle of
explosion is valid inference even though there is zero >>>>>>>>>>>>>>>>> doubt the it
derives the non-sequitur error.

Nope, that just means you don't understand how logic works. >>>>>>>>>>>>>>>>
YOU are the psychotic.

*When we encode the principle of explosion as a syllogism* >>>>>>>>>>>>>>>>> Socrates is a man.
Socrates is not a man.
Therefore, Socrates is a butterfly.

Nope. And that is because the principle of explosion is >>>>>>>>>>>>>>>> NOT a "syllogism"

You are again just proving your stupidity.

The conclusion does not follow from the premises, thus >>>>>>>>>>>>>>>>> the non-sequitur error.
https://en.wikipedia.org/wiki/Principle_of_explosion >>>>>>>>>>>>>>>>

So, which step doesn't is incorrect.

Givens:
Proposition A is True.
Proposition A is False.

The syllogism would be dead right there.
Some A are True
No A are True

So, you don't understand what the principle of explosion >>>>>>>>>>>>>> actually is.

Some A are True
No A are True
therefore B

Which was proven.

You are indoctrinated into believing that the non-sequitur error >>>>>>>>>>> is not an error. The only semantics that passes out of (A ∧ ~A) >>>>>>>>>>> is FALSE.

And you only get the "non-sequitur" form because The Principle >>>>>>>>>> of Explosion is not a Syllogism. It is a THEOREM.

All A are True
No A are True
Therefore B

(1) Is a pair of proper categorical propositions.
     https://en.wikipedia.org/wiki/Categorical_proposition >>>>>>>>> (2) That are isomorphic to the Principle of Explosion.
(3) And do form the non-sequitur error.

In simple words, you are just admitting that you are a stupid
idiot, not reading the replies and just reposting your lies.

The Principle of explosion is NOT stated as a Syllogism, because >>>>>>>> the form of a Syllogism can't handle it,

I just proved that the syllogism DID handle it. You are trying
to get away with a dictatorial fiat rebuttal to point (2).

Then you don't understand what a Syllogism is.

It is ALWAYS a pair of statements, each relating two "terms" with
one term in common between the two statements, and the conclusion
being a relationship between the two other terms.

There you go. So when we correctly translate the POE into a
syllogism we can see that it is invalid because it never has any
relationship to the other two terms.

Which just means that the Principle of Explosion can not be reduced
to a Syllogism.

The premises of the POE proposition <ARE> isomorphic
to their categorical proposition equivalents.
The conclusion is identical thus not even translated.

Therefore the POE argument was correctly translated into
a syllogism that is invalid only because the POE argument
was invalid.

So, yes, you have translated an expression of the Principle of
Explossion into a rough Syllogism form, and found it fails to
actuallly meet the form of a Syllogism.

I translated it correctly and it only fails to be a valid
syllogism because as I have claimed all along POE really
is exactly the non-sequitur error.

Then what was wrong with MY proof I gave earlier?

IF you can't show an error that means that your "correct reasoning" is
an inconsistant logic system as it allows us to proof both that the
Principle of Explosion is a True Theorem and a FALSE statement.

And then, by the principle of explosion, it just blows itself to smiterines.


Since you have made the assertion that POE must be false, you need to
now find the error in my proof or you are just admitting that you ogic
system is inconsistant.

That doesn't mean that the Principle of Explosion is an incorrect
theorem, just that is didn't express as a Syllogism.

You saying that makes the POE to be invalid just proves that you do
not understand even the BASICS of how logic works, and thus NOTHING
you have said should be considered to have any impact.

Face it, you are just burying your reputation under miles of errors
and falsehoods, so no one is going to take any of your work seriously.

Which is perhaps too bad, as there may have been some idea that could
have been teased out of it that had some possible application.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: sci.logic

On 4/28/24 3:43 PM, olcott wrote:

On 4/28/2024 2:29 PM, Richard Damon wrote:

On 4/28/24 3:06 PM, olcott wrote:

On 4/28/2024 1:42 PM, Richard Damon wrote:

On 4/28/24 2:23 PM, olcott wrote:

On 4/28/2024 1:18 PM, Richard Damon wrote:

On 4/28/24 1:55 PM, olcott wrote:

On 4/28/2024 12:34 PM, Richard Damon wrote:

On 4/28/24 10:15 AM, olcott wrote:

On 4/28/2024 9:00 AM, Richard Damon wrote:

On 4/28/24 9:45 AM, olcott wrote:

On 4/28/2024 8:13 AM, Richard Damon wrote:

On 4/27/24 11:45 PM, olcott wrote:

On 4/27/2024 10:31 PM, Richard Damon wrote:

On 4/27/24 10:33 PM, olcott wrote:

On 4/27/2024 9:09 PM, Richard Damon wrote:

On 4/27/24 9:54 PM, olcott wrote:

On 4/27/2024 8:39 PM, Richard Damon wrote:

On 4/27/24 8:58 PM, olcott wrote:

On 4/27/2024 7:49 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>> On 4/27/24 8:17 PM, olcott wrote:

Can D simulated by H terminate normally? >>>>>>>>>>>>>>>>>>>>>
The x86utm operating system based on an open source >>>>>>>>>>>>>>>>>>>>> x86 emulator.
This system enables one C function to execute >>>>>>>>>>>>>>>>>>>>> another C function
in debug step mode. When H simulates D it creates a >>>>>>>>>>>>>>>>>>>>> separate process
context for D with its own memory, stack and >>>>>>>>>>>>>>>>>>>>> virtual registers. H
is able to simulate D simulating itself, thus the >>>>>>>>>>>>>>>>>>>>> only limit to
recursive simulations is RAM.

// The following is written in C
//
01 typedef int (*ptr)(); // pointer to int function >>>>>>>>>>>>>>>>>>>>> 02 int H(ptr x, ptr y)    // uses x86 emulator to >>>>>>>>>>>>>>>>>>>>> simulate its input
03
04 int D(ptr x)
05 {
06   int Halt_Status = H(x, x);
07   if (Halt_Status)
08     HERE: goto HERE;
09   return Halt_Status;
10 }
11
12 void main()
13 {
14   D(D);
15 }

Execution Trace
Line 14: main() invokes D(D)

keeps repeating (unless aborted)
Line 06: simulated D(D) invokes simulated H(D,D) >>>>>>>>>>>>>>>>>>>>> that simulates D(D)

Simulation invariant
D correctly simulated by H cannot possibly reach >>>>>>>>>>>>>>>>>>>>> its own line 09.

Is it dead obvious to everyone here when examining >>>>>>>>>>>>>>>>>>>>> the execution
trace of lines 14 and 06 above that D correctly >>>>>>>>>>>>>>>>>>>>> simulated by H cannot
possibly terminate normally by reaching its own >>>>>>>>>>>>>>>>>>>>> line 09?

Except that you fail to mention that you have >>>>>>>>>>>>>>>>>>>> admitted that you are NOT working on the Halting >>>>>>>>>>>>>>>>>>>> Problem, despite trying to use terminology similar >>>>>>>>>>>>>>>>>>>> to it, but having stipulated definition that are in >>>>>>>>>>>>>>>>>>>> conflict with computaiton theory.

Note, "keeps repeating (unless aborted)" is a >>>>>>>>>>>>>>>>>>>> misleading statement, as your H will ALWAYS abort >>>>>>>>>>>>>>>>>>>> this input, and thus it NEVER will "Keep repeating". >>>>>>>>>>>>>>>>>>>>
You don't like me pointing out the problem because >>>>>>>>>>>>>>>>>>>> you prefer to be able to LIE to people about what >>>>>>>>>>>>>>>>>>>> you are doing.

You work has NOTHING to do with Halting, as your H/D >>>>>>>>>>>>>>>>>>>> are not even turing equivalenet to their namesakes >>>>>>>>>>>>>>>>>>>> in the proof you like to mention.

That is the exact verbatim post and the first >>>>>>>>>>>>>>>>>>> respondent agreed
and immediately noticed that I was referring to the >>>>>>>>>>>>>>>>>>> halting problem.

So I will go with what I said, you just don't know C >>>>>>>>>>>>>>>>>>> very
well and want to keep that hidden behind rhetoric and >>>>>>>>>>>>>>>>>>> denigration.

Yes, you couch it to SOUND like the halting problem, >>>>>>>>>>>>>>>>>> but it isn't as you have FUNDAMENTALLY CHANGED the >>>>>>>>>>>>>>>>>> meaning of terms.

And thus, to act like it is, just makes you a LIAR. >>>>>>>>>>>>>>>>>>
Halting is NOT about H being able to simulate it input >>>>>>>>>>>>>>>>>> to the final state. PERIOD.

I could show how it is but you prefer to believe >>>>>>>>>>>>>>>>> otherwise and refuse
to go through the detailed steps required.

No, you CAN'T, because you have FUNDAMENTALLY changed >>>>>>>>>>>>>>>> the question, sinc eyou claim that even though D(D) >>>>>>>>>>>>>>>> Halts, that H(D,D) is correct to say not halting. >>>>>>>>>>>>>>>>

It is not my error it is your indoctrination.

So, How is H(D,D) saying false correct if D(D) Halts? >>>>>>>>>>>>>>

You refuse to go through the mandatory steps.

YOU are the only one that says they are "Manditory".

That doesn't make them so for me.

YOU refuse to explain how a Halting Turing Machine can be >>>>>>>>>>>> correctly decider as "Non-Halting".

Your "excuses" all seem to boil down to you just need to lie >>>>>>>>>>>> about what you are actually doing and that you refuse to >>>>>>>>>>>> even learn what the actual rules and language of what you >>>>>>>>>>>> are saying you are doing are.

SInce the DEFINITION of the quesiton that H, the Halt >>>>>>>>>>>>>> Decider, is to answer is if the computation describe by >>>>>>>>>>>>>> its input (that is D(D) ) will halt when run.

You have to hide behind obfuscation, blusgter and LIES. >>>>>>>>>>>>>>
Since you don't seem to know that actual meaning of the >>>>>>>>>>>>>> words you use, as you have even occationally admitted, it >>>>>>>>>>>>>> is clear who knows what they are talking about and who >>>>>>>>>>>>>> doesn't.

I will also point out that you have effectively admitted >>>>>>>>>>>>>> that your statements are unsopported as you always fail to >>>>>>>>>>>>>> provide actual references to accepted ground for your claims. >>>>>>>>>>>>>>

It is psychotic that people really believes that the >>>>>>>>>>>>>>>>> principle of
explosion is valid inference even though there is zero >>>>>>>>>>>>>>>>> doubt the it
derives the non-sequitur error.

Nope, that just means you don't understand how logic works. >>>>>>>>>>>>>>>>
YOU are the psychotic.

*When we encode the principle of explosion as a syllogism* >>>>>>>>>>>>>>>>> Socrates is a man.
Socrates is not a man.
Therefore, Socrates is a butterfly.

Nope. And that is because the principle of explosion is >>>>>>>>>>>>>>>> NOT a "syllogism"

You are again just proving your stupidity.

The conclusion does not follow from the premises, thus >>>>>>>>>>>>>>>>> the non-sequitur error.
https://en.wikipedia.org/wiki/Principle_of_explosion >>>>>>>>>>>>>>>>

So, which step doesn't is incorrect.

Givens:
Proposition A is True.
Proposition A is False.

The syllogism would be dead right there.
Some A are True
No A are True

So, you don't understand what the principle of explosion >>>>>>>>>>>>>> actually is.

Some A are True
No A are True
therefore B

Which was proven.

You are indoctrinated into believing that the non-sequitur error >>>>>>>>>>> is not an error. The only semantics that passes out of (A ∧ ~A) >>>>>>>>>>> is FALSE.

And you only get the "non-sequitur" form because The Principle >>>>>>>>>> of Explosion is not a Syllogism. It is a THEOREM.

All A are True
No A are True
Therefore B

(1) Is a pair of proper categorical propositions.
     https://en.wikipedia.org/wiki/Categorical_proposition >>>>>>>>> (2) That are isomorphic to the Principle of Explosion.
(3) And do form the non-sequitur error.

In simple words, you are just admitting that you are a stupid
idiot, not reading the replies and just reposting your lies.

The Principle of explosion is NOT stated as a Syllogism, because >>>>>>>> the form of a Syllogism can't handle it,

I just proved that the syllogism DID handle it. You are trying
to get away with a dictatorial fiat rebuttal to point (2).

Then you don't understand what a Syllogism is.

It is ALWAYS a pair of statements, each relating two "terms" with
one term in common between the two statements, and the conclusion
being a relationship between the two other terms.

There you go. So when we correctly translate the POE into a
syllogism we can see that it is invalid because it never has any
relationship to the other two terms.

Which just means that the Principle of Explosion can not be reduced
to a Syllogism.

The premises of the POE proposition <ARE> isomorphic
to their categorical proposition equivalents.
The conclusion is identical thus not even translated.

Therefore the POE argument was correctly translated into
a syllogism that is invalid only because the POE argument
was invalid.

So, yes, you have translated an expression of the Principle of
Explossion into a rough Syllogism form, and found it fails to
actuallly meet the form of a Syllogism.

That doesn't mean that the Principle of Explosion is an incorrect
theorem, just that is didn't express as a Syllogism.

You saying that makes the POE to be invalid just proves that you do
not understand even the BASICS of how logic works, and thus NOTHING
you have said should be considered to have any impact.

*That you couldn't point out any specific mistakes proves YOU ARE WRONG*

YOU didn't say anything substative.

You just said that since the Syllogism was invalid that POE can't be
right, which isn't a valid argument.

Please TRY to point out reference that says that a Theorem that can't be reduced to a syllogism must be incorrect.

It was translated correctly and the end result is a syllogism with the non-sequitur error that I have been saying all along.

Which means it doesn't become a valid sylogism, not that it isn't a
valid theorem.

I guess you think that the Pythogorean theorem is invalid since you
can't form a valid sylogism from it.

Face it, you are just burying your reputation under miles of errors
and falsehoods, so no one is going to take any of your work seriously.

*I proved my point and you tried to refute it with pure bluster*

Nope, it prove you don't understand logic.

Again, point to something published by a reliable source that says that
if a theorem can't be converted into a valid sylogism, it is invalid.

By you logic the proof that goes:

Cats are Felines
Felines are Mammels
Mammels are Animals
Therefore
Cats are Animals

Isn't valid, as a Sylogism, BY DEFINITION, only has two premises, that
must have a common term, not three.

You are just proving how stupid you are.

Which is perhaps too bad, as there may have been some idea that could
have been teased out of it that had some possible application.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: sci.logic

On 4/29/24 12:07 AM, olcott wrote:

On 4/28/2024 6:01 PM, Richard Damon wrote:

On 4/28/24 6:28 PM, olcott wrote:

On 4/28/2024 2:29 PM, Richard Damon wrote:

On 4/28/24 3:06 PM, olcott wrote:

On 4/28/2024 1:42 PM, Richard Damon wrote:

On 4/28/24 2:23 PM, olcott wrote:

On 4/28/2024 1:18 PM, Richard Damon wrote:

On 4/28/24 1:55 PM, olcott wrote:

On 4/28/2024 12:34 PM, Richard Damon wrote:

On 4/28/24 10:15 AM, olcott wrote:

On 4/28/2024 9:00 AM, Richard Damon wrote:

On 4/28/24 9:45 AM, olcott wrote:

On 4/28/2024 8:13 AM, Richard Damon wrote:

On 4/27/24 11:45 PM, olcott wrote:

On 4/27/2024 10:31 PM, Richard Damon wrote:

On 4/27/24 10:33 PM, olcott wrote:

On 4/27/2024 9:09 PM, Richard Damon wrote:

On 4/27/24 9:54 PM, olcott wrote:

On 4/27/2024 8:39 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>> On 4/27/24 8:58 PM, olcott wrote:

On 4/27/2024 7:49 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>>>> On 4/27/24 8:17 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> Can D simulated by H terminate normally? >>>>>>>>>>>>>>>>>>>>>>>

The x86utm operating system based on an open >>>>>>>>>>>>>>>>>>>>>>> source x86 emulator.
This system enables one C function to execute >>>>>>>>>>>>>>>>>>>>>>> another C function
in debug step mode. When H simulates D it creates >>>>>>>>>>>>>>>>>>>>>>> a separate process
context for D with its own memory, stack and >>>>>>>>>>>>>>>>>>>>>>> virtual registers. H
is able to simulate D simulating itself, thus the >>>>>>>>>>>>>>>>>>>>>>> only limit to
recursive simulations is RAM.

// The following is written in C >>>>>>>>>>>>>>>>>>>>>>> //
01 typedef int (*ptr)(); // pointer to int function >>>>>>>>>>>>>>>>>>>>>>> 02 int H(ptr x, ptr y)    // uses x86 emulator to >>>>>>>>>>>>>>>>>>>>>>> simulate its input
03
04 int D(ptr x)
05 {
06   int Halt_Status = H(x, x); >>>>>>>>>>>>>>>>>>>>>>> 07   if (Halt_Status)
08     HERE: goto HERE;
09   return Halt_Status;
10 }
11
12 void main()
13 {
14   D(D);
15 }

Execution Trace
Line 14: main() invokes D(D)

keeps repeating (unless aborted) >>>>>>>>>>>>>>>>>>>>>>> Line 06: simulated D(D) invokes simulated H(D,D) >>>>>>>>>>>>>>>>>>>>>>> that simulates D(D)

Simulation invariant
D correctly simulated by H cannot possibly reach >>>>>>>>>>>>>>>>>>>>>>> its own line 09.

Is it dead obvious to everyone here when >>>>>>>>>>>>>>>>>>>>>>> examining the execution
trace of lines 14 and 06 above that D correctly >>>>>>>>>>>>>>>>>>>>>>> simulated by H cannot
possibly terminate normally by reaching its own >>>>>>>>>>>>>>>>>>>>>>> line 09?

Except that you fail to mention that you have >>>>>>>>>>>>>>>>>>>>>> admitted that you are NOT working on the Halting >>>>>>>>>>>>>>>>>>>>>> Problem, despite trying to use terminology similar >>>>>>>>>>>>>>>>>>>>>> to it, but having stipulated definition that are >>>>>>>>>>>>>>>>>>>>>> in conflict with computaiton theory. >>>>>>>>>>>>>>>>>>>>>>
Note, "keeps repeating (unless aborted)" is a >>>>>>>>>>>>>>>>>>>>>> misleading statement, as your H will ALWAYS abort >>>>>>>>>>>>>>>>>>>>>> this input, and thus it NEVER will "Keep repeating". >>>>>>>>>>>>>>>>>>>>>>
You don't like me pointing out the problem because >>>>>>>>>>>>>>>>>>>>>> you prefer to be able to LIE to people about what >>>>>>>>>>>>>>>>>>>>>> you are doing.

You work has NOTHING to do with Halting, as your >>>>>>>>>>>>>>>>>>>>>> H/D are not even turing equivalenet to their >>>>>>>>>>>>>>>>>>>>>> namesakes in the proof you like to mention. >>>>>>>>>>>>>>>>>>>>>

That is the exact verbatim post and the first >>>>>>>>>>>>>>>>>>>>> respondent agreed
and immediately noticed that I was referring to the >>>>>>>>>>>>>>>>>>>>> halting problem.

So I will go with what I said, you just don't know >>>>>>>>>>>>>>>>>>>>> C very
well and want to keep that hidden behind rhetoric >>>>>>>>>>>>>>>>>>>>> and denigration.

Yes, you couch it to SOUND like the halting problem, >>>>>>>>>>>>>>>>>>>> but it isn't as you have FUNDAMENTALLY CHANGED the >>>>>>>>>>>>>>>>>>>> meaning of terms.

And thus, to act like it is, just makes you a LIAR. >>>>>>>>>>>>>>>>>>>>
Halting is NOT about H being able to simulate it >>>>>>>>>>>>>>>>>>>> input to the final state. PERIOD.

I could show how it is but you prefer to believe >>>>>>>>>>>>>>>>>>> otherwise and refuse
to go through the detailed steps required. >>>>>>>>>>>>>>>>>>

No, you CAN'T, because you have FUNDAMENTALLY changed >>>>>>>>>>>>>>>>>> the question, sinc eyou claim that even though D(D) >>>>>>>>>>>>>>>>>> Halts, that H(D,D) is correct to say not halting. >>>>>>>>>>>>>>>>>>

It is not my error it is your indoctrination. >>>>>>>>>>>>>>>>

So, How is H(D,D) saying false correct if D(D) Halts? >>>>>>>>>>>>>>>>

You refuse to go through the mandatory steps.

YOU are the only one that says they are "Manditory". >>>>>>>>>>>>>>
That doesn't make them so for me.

YOU refuse to explain how a Halting Turing Machine can be >>>>>>>>>>>>>> correctly decider as "Non-Halting".

Your "excuses" all seem to boil down to you just need to >>>>>>>>>>>>>> lie about what you are actually doing and that you refuse >>>>>>>>>>>>>> to even learn what the actual rules and language of what >>>>>>>>>>>>>> you are saying you are doing are.

SInce the DEFINITION of the quesiton that H, the Halt >>>>>>>>>>>>>>>> Decider, is to answer is if the computation describe by >>>>>>>>>>>>>>>> its input (that is D(D) ) will halt when run.

You have to hide behind obfuscation, blusgter and LIES. >>>>>>>>>>>>>>>>
Since you don't seem to know that actual meaning of the >>>>>>>>>>>>>>>> words you use, as you have even occationally admitted, >>>>>>>>>>>>>>>> it is clear who knows what they are talking about and >>>>>>>>>>>>>>>> who doesn't.

I will also point out that you have effectively admitted >>>>>>>>>>>>>>>> that your statements are unsopported as you always fail >>>>>>>>>>>>>>>> to provide actual references to accepted ground for your >>>>>>>>>>>>>>>> claims.

It is psychotic that people really believes that the >>>>>>>>>>>>>>>>>>> principle of
explosion is valid inference even though there is >>>>>>>>>>>>>>>>>>> zero doubt the it
derives the non-sequitur error.

Nope, that just means you don't understand how logic >>>>>>>>>>>>>>>>>> works.

YOU are the psychotic.

*When we encode the principle of explosion as a >>>>>>>>>>>>>>>>>>> syllogism*
Socrates is a man.
Socrates is not a man.
Therefore, Socrates is a butterfly.

Nope. And that is because the principle of explosion >>>>>>>>>>>>>>>>>> is NOT a "syllogism"

You are again just proving your stupidity. >>>>>>>>>>>>>>>>>>

The conclusion does not follow from the premises, >>>>>>>>>>>>>>>>>>> thus the non-sequitur error.
https://en.wikipedia.org/wiki/Principle_of_explosion >>>>>>>>>>>>>>>>>>

So, which step doesn't is incorrect.

Givens:
Proposition A is True.
Proposition A is False.

The syllogism would be dead right there.
Some A are True
No A are True

So, you don't understand what the principle of explosion >>>>>>>>>>>>>>>> actually is.

Some A are True
No A are True
therefore B

Which was proven.

You are indoctrinated into believing that the non-sequitur >>>>>>>>>>>>> error
is not an error. The only semantics that passes out of (A ∧ >>>>>>>>>>>>> ~A)
is FALSE.

And you only get the "non-sequitur" form because The
Principle of Explosion is not a Syllogism. It is a THEOREM. >>>>>>>>>>>>

All A are True
No A are True
Therefore B

(1) Is a pair of proper categorical propositions.
     https://en.wikipedia.org/wiki/Categorical_proposition >>>>>>>>>>> (2) That are isomorphic to the Principle of Explosion.
(3) And do form the non-sequitur error.

In simple words, you are just admitting that you are a stupid >>>>>>>>>> idiot, not reading the replies and just reposting your lies. >>>>>>>>>>
The Principle of explosion is NOT stated as a Syllogism,
because the form of a Syllogism can't handle it,

I just proved that the syllogism DID handle it. You are trying >>>>>>>>> to get away with a dictatorial fiat rebuttal to point (2).

Then you don't understand what a Syllogism is.

It is ALWAYS a pair of statements, each relating two "terms"
with one term in common between the two statements, and the
conclusion being a relationship between the two other terms.

There you go. So when we correctly translate the POE into a
syllogism we can see that it is invalid because it never has any >>>>>>> relationship to the other two terms.

Which just means that the Principle of Explosion can not be
reduced to a Syllogism.

The premises of the POE proposition <ARE> isomorphic
to their categorical proposition equivalents.
The conclusion is identical thus not even translated.

Therefore the POE argument was correctly translated into
a syllogism that is invalid only because the POE argument
was invalid.

So, yes, you have translated an expression of the Principle of
Explossion into a rough Syllogism form, and found it fails to
actuallly meet the form of a Syllogism.

I translated it correctly and it only fails to be a valid
syllogism because as I have claimed all along POE really
is exactly the non-sequitur error.

Then what was wrong with MY proof I gave earlier?

The only proof that I saw was unmitigated bluster with no basis.

I.E, you don't understand that laws of logic or how to see a proof.

I'll give it again, in a bit more detail:

Givens:

1) A is True.
2) ~A is True.

Logic Rules we will use:
3) IF A is true, then A | B is true.
4) If A | B is true, and A is false, then B is True

Goal:
5) B is True.


Steps:
6) from 1 and 3, we can assert that A | B must be true
7) from 2 and 6, we can assert that B must be true.

QED

Point to the line with the error.

Yes, I admit that I didn't do it in categorical logic, but POE is
broader than categorical logic.

You can consider A to be the statement that Some A are True, and thus ~A
is No A are TRue.

You already agreed that the translation is correct and results
in the same non-sequitur that I have been claiming all along.
How is that any rebuttal?

Because just because something can't be converted into a Sylogism
doesn't make it wrong.

By your logic, 1 + 1 is not 2

Your way of agreeing with the non-sequitur error is saying that
the resulting syllogism is invalid, that is what non-sequitur means.

Yes, it is not a syllogism, but that doesn't make the statement invalid.

Unless, you think the only valid logic IS syllogism, and thus your logic
can't talk about a lot of things, like programs.

I'll give you a hint, Computation Theory needs logic greater that
Syllogisms at its core.

You are just admitting that your logic ability is inadiquiate to handle
the fields of logic you are trying to tackle.

It is like trying to do trig on a four function calculator.

IF you can't show an error that means that your "correct reasoning" is
an inconsistant logic system as it allows us to proof both that the
Principle of Explosion is a True Theorem and a FALSE statement.

And then, by the principle of explosion, it just blows itself to
smiterines.


Since you have made the assertion that POE must be false, you need to
now find the error in my proof or you are just admitting that you ogic
system is inconsistant.

That doesn't mean that the Principle of Explosion is an incorrect
theorem, just that is didn't express as a Syllogism.

You saying that makes the POE to be invalid just proves that you do
not understand even the BASICS of how logic works, and thus NOTHING
you have said should be considered to have any impact.

Face it, you are just burying your reputation under miles of errors
and falsehoods, so no one is going to take any of your work seriously. >>>>
Which is perhaps too bad, as there may have been some idea that
could have been teased out of it that had some possible application.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)

XPost: sci.logic

On 4/29/24 10:47 AM, olcott wrote:

On 4/29/2024 6:25 AM, Richard Damon wrote:

On 4/29/24 12:07 AM, olcott wrote:

On 4/28/2024 6:01 PM, Richard Damon wrote:

On 4/28/24 6:28 PM, olcott wrote:

On 4/28/2024 2:29 PM, Richard Damon wrote:

On 4/28/24 3:06 PM, olcott wrote:

On 4/28/2024 1:42 PM, Richard Damon wrote:

On 4/28/24 2:23 PM, olcott wrote:

On 4/28/2024 1:18 PM, Richard Damon wrote:

On 4/28/24 1:55 PM, olcott wrote:

On 4/28/2024 12:34 PM, Richard Damon wrote:

On 4/28/24 10:15 AM, olcott wrote:

On 4/28/2024 9:00 AM, Richard Damon wrote:

On 4/28/24 9:45 AM, olcott wrote:

On 4/28/2024 8:13 AM, Richard Damon wrote:

On 4/27/24 11:45 PM, olcott wrote:

On 4/27/2024 10:31 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>> On 4/27/24 10:33 PM, olcott wrote:

On 4/27/2024 9:09 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>> On 4/27/24 9:54 PM, olcott wrote:

On 4/27/2024 8:39 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>>>> On 4/27/24 8:58 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>> On 4/27/2024 7:49 PM, Richard Damon wrote: >>>>>>>>>>>>>>>>>>>>>>>> On 4/27/24 8:17 PM, olcott wrote: >>>>>>>>>>>>>>>>>>>>>>>>> Can D simulated by H terminate normally? >>>>>>>>>>>>>>>>>>>>>>>>>

The x86utm operating system based on an open >>>>>>>>>>>>>>>>>>>>>>>>> source x86 emulator.
This system enables one C function to execute >>>>>>>>>>>>>>>>>>>>>>>>> another C function
in debug step mode. When H simulates D it >>>>>>>>>>>>>>>>>>>>>>>>> creates a separate process
context for D with its own memory, stack and >>>>>>>>>>>>>>>>>>>>>>>>> virtual registers. H
is able to simulate D simulating itself, thus >>>>>>>>>>>>>>>>>>>>>>>>> the only limit to
recursive simulations is RAM. >>>>>>>>>>>>>>>>>>>>>>>>>
// The following is written in C >>>>>>>>>>>>>>>>>>>>>>>>> //
01 typedef int (*ptr)(); // pointer to int >>>>>>>>>>>>>>>>>>>>>>>>> function
02 int H(ptr x, ptr y)    // uses x86 emulator >>>>>>>>>>>>>>>>>>>>>>>>> to simulate its input
03
04 int D(ptr x)
05 {
06   int Halt_Status = H(x, x); >>>>>>>>>>>>>>>>>>>>>>>>> 07   if (Halt_Status)
08     HERE: goto HERE;
09   return Halt_Status;
10 }
11
12 void main()
13 {
14   D(D);
15 }

Execution Trace
Line 14: main() invokes D(D) >>>>>>>>>>>>>>>>>>>>>>>>>
keeps repeating (unless aborted) >>>>>>>>>>>>>>>>>>>>>>>>> Line 06: simulated D(D) invokes simulated >>>>>>>>>>>>>>>>>>>>>>>>> H(D,D) that simulates D(D)

Simulation invariant
D correctly simulated by H cannot possibly >>>>>>>>>>>>>>>>>>>>>>>>> reach its own line 09.

Is it dead obvious to everyone here when >>>>>>>>>>>>>>>>>>>>>>>>> examining the execution
trace of lines 14 and 06 above that D correctly >>>>>>>>>>>>>>>>>>>>>>>>> simulated by H cannot
possibly terminate normally by reaching its own >>>>>>>>>>>>>>>>>>>>>>>>> line 09?

Except that you fail to mention that you have >>>>>>>>>>>>>>>>>>>>>>>> admitted that you are NOT working on the Halting >>>>>>>>>>>>>>>>>>>>>>>> Problem, despite trying to use terminology >>>>>>>>>>>>>>>>>>>>>>>> similar to it, but having stipulated definition >>>>>>>>>>>>>>>>>>>>>>>> that are in conflict with computaiton theory. >>>>>>>>>>>>>>>>>>>>>>>>
Note, "keeps repeating (unless aborted)" is a >>>>>>>>>>>>>>>>>>>>>>>> misleading statement, as your H will ALWAYS >>>>>>>>>>>>>>>>>>>>>>>> abort this input, and thus it NEVER will "Keep >>>>>>>>>>>>>>>>>>>>>>>> repeating".

You don't like me pointing out the problem >>>>>>>>>>>>>>>>>>>>>>>> because you prefer to be able to LIE to people >>>>>>>>>>>>>>>>>>>>>>>> about what you are doing.

You work has NOTHING to do with Halting, as your >>>>>>>>>>>>>>>>>>>>>>>> H/D are not even turing equivalenet to their >>>>>>>>>>>>>>>>>>>>>>>> namesakes in the proof you like to mention. >>>>>>>>>>>>>>>>>>>>>>>

That is the exact verbatim post and the first >>>>>>>>>>>>>>>>>>>>>>> respondent agreed
and immediately noticed that I was referring to >>>>>>>>>>>>>>>>>>>>>>> the halting problem.

So I will go with what I said, you just don't >>>>>>>>>>>>>>>>>>>>>>> know C very
well and want to keep that hidden behind rhetoric >>>>>>>>>>>>>>>>>>>>>>> and denigration.

Yes, you couch it to SOUND like the halting >>>>>>>>>>>>>>>>>>>>>> problem, but it isn't as you have FUNDAMENTALLY >>>>>>>>>>>>>>>>>>>>>> CHANGED the meaning of terms.

And thus, to act like it is, just makes you a LIAR. >>>>>>>>>>>>>>>>>>>>>>
Halting is NOT about H being able to simulate it >>>>>>>>>>>>>>>>>>>>>> input to the final state. PERIOD.

I could show how it is but you prefer to believe >>>>>>>>>>>>>>>>>>>>> otherwise and refuse
to go through the detailed steps required. >>>>>>>>>>>>>>>>>>>>

No, you CAN'T, because you have FUNDAMENTALLY >>>>>>>>>>>>>>>>>>>> changed the question, sinc eyou claim that even >>>>>>>>>>>>>>>>>>>> though D(D) Halts, that H(D,D) is correct to say not >>>>>>>>>>>>>>>>>>>> halting.

It is not my error it is your indoctrination. >>>>>>>>>>>>>>>>>>

So, How is H(D,D) saying false correct if D(D) Halts? >>>>>>>>>>>>>>>>>>

You refuse to go through the mandatory steps. >>>>>>>>>>>>>>>>

YOU are the only one that says they are "Manditory". >>>>>>>>>>>>>>>>
That doesn't make them so for me.

YOU refuse to explain how a Halting Turing Machine can >>>>>>>>>>>>>>>> be correctly decider as "Non-Halting".

Your "excuses" all seem to boil down to you just need to >>>>>>>>>>>>>>>> lie about what you are actually doing and that you >>>>>>>>>>>>>>>> refuse to even learn what the actual rules and language >>>>>>>>>>>>>>>> of what you are saying you are doing are.

SInce the DEFINITION of the quesiton that H, the Halt >>>>>>>>>>>>>>>>>> Decider, is to answer is if the computation describe >>>>>>>>>>>>>>>>>> by its input (that is D(D) ) will halt when run. >>>>>>>>>>>>>>>>>>
You have to hide behind obfuscation, blusgter and LIES. >>>>>>>>>>>>>>>>>>
Since you don't seem to know that actual meaning of >>>>>>>>>>>>>>>>>> the words you use, as you have even occationally >>>>>>>>>>>>>>>>>> admitted, it is clear who knows what they are talking >>>>>>>>>>>>>>>>>> about and who doesn't.

I will also point out that you have effectively >>>>>>>>>>>>>>>>>> admitted that your statements are unsopported as you >>>>>>>>>>>>>>>>>> always fail to provide actual references to accepted >>>>>>>>>>>>>>>>>> ground for your claims.

It is psychotic that people really believes that >>>>>>>>>>>>>>>>>>>>> the principle of
explosion is valid inference even though there is >>>>>>>>>>>>>>>>>>>>> zero doubt the it
derives the non-sequitur error.

Nope, that just means you don't understand how logic >>>>>>>>>>>>>>>>>>>> works.

YOU are the psychotic.

*When we encode the principle of explosion as a >>>>>>>>>>>>>>>>>>>>> syllogism*
Socrates is a man.
Socrates is not a man.
Therefore, Socrates is a butterfly.

Nope. And that is because the principle of explosion >>>>>>>>>>>>>>>>>>>> is NOT a "syllogism"

You are again just proving your stupidity. >>>>>>>>>>>>>>>>>>>>

The conclusion does not follow from the premises, >>>>>>>>>>>>>>>>>>>>> thus the non-sequitur error.
https://en.wikipedia.org/wiki/Principle_of_explosion >>>>>>>>>>>>>>>>>>>>

So, which step doesn't is incorrect.

Givens:
Proposition A is True.
Proposition A is False.

The syllogism would be dead right there. >>>>>>>>>>>>>>>>>>> Some A are True
No A are True

So, you don't understand what the principle of >>>>>>>>>>>>>>>>>> explosion actually is.

Some A are True
No A are True
therefore B

Which was proven.

You are indoctrinated into believing that the
non-sequitur error
is not an error. The only semantics that passes out of (A >>>>>>>>>>>>>>> ∧ ~A)
is FALSE.

And you only get the "non-sequitur" form because The >>>>>>>>>>>>>> Principle of Explosion is not a Syllogism. It is a THEOREM. >>>>>>>>>>>>>>

All A are True
No A are True
Therefore B

(1) Is a pair of proper categorical propositions.
     https://en.wikipedia.org/wiki/Categorical_proposition >>>>>>>>>>>>> (2) That are isomorphic to the Principle of Explosion. >>>>>>>>>>>>> (3) And do form the non-sequitur error.

In simple words, you are just admitting that you are a >>>>>>>>>>>> stupid idiot, not reading the replies and just reposting >>>>>>>>>>>> your lies.

The Principle of explosion is NOT stated as a Syllogism, >>>>>>>>>>>> because the form of a Syllogism can't handle it,

I just proved that the syllogism DID handle it. You are trying >>>>>>>>>>> to get away with a dictatorial fiat rebuttal to point (2). >>>>>>>>>>

Then you don't understand what a Syllogism is.

It is ALWAYS a pair of statements, each relating two "terms" >>>>>>>>>> with one term in common between the two statements, and the >>>>>>>>>> conclusion being a relationship between the two other terms. >>>>>>>>>

There you go. So when we correctly translate the POE into a
syllogism we can see that it is invalid because it never has >>>>>>>>> any relationship to the other two terms.

Which just means that the Principle of Explosion can not be
reduced to a Syllogism.

The premises of the POE proposition <ARE> isomorphic
to their categorical proposition equivalents.
The conclusion is identical thus not even translated.

Therefore the POE argument was correctly translated into
a syllogism that is invalid only because the POE argument
was invalid.

So, yes, you have translated an expression of the Principle of
Explossion into a rough Syllogism form, and found it fails to
actuallly meet the form of a Syllogism.

I translated it correctly and it only fails to be a valid
syllogism because as I have claimed all along POE really
is exactly the non-sequitur error.

Then what was wrong with MY proof I gave earlier?

The only proof that I saw was unmitigated bluster with no basis.

I.E, you don't understand that laws of logic or how to see a proof.

I'll give it again, in a bit more detail:

Givens:

1) A is True.
2) ~A is True.

Logic Rules we will use:
3) IF A is true, then A | B is true.
4) If A | B is true, and A is false, then B is True

The assumption that (A and ~A) is true is proven to be nonsense

But that is the GIVEN of the Principle of Explosion.

I guess you have no idea what it actually is, because you just don't
understand how logic works,


So, all you have done is prove that AGAIN, you are talking about
something that you do not understand.

If you REALLY think that there can never be a system with contradictory expressions in it, you are just totally nieve (and stupid).

when this is translated into a syllogism:

Proposition A is True.
Proposition A is False.
Therefore B

Translated into a syllogism:

All A are True
No A are True
Therefore B
and the resulting syllogism has the non-sequitur error.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)