Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #31546 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-04-19 23:20 -0500 |
| Last post | 2021-04-20 10:29 -0500 |
| Articles | 20 on this page of 67 — 6 participants |
Back to article view | Back to comp.theory
Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-19 23:20 -0500
Re: Equivalent halting definitions "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-04-19 22:21 -0700
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:26 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:33 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:40 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:52 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:59 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:16 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 11:37 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:46 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 12:56 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 18:42 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 14:28 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 20:23 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 15:34 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 22:12 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 17:24 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 14:54 -0400
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 08:04 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:33 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:54 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 11:03 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:18 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 11:38 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:48 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 12:44 -0500
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 14:57 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 14:23 -0500
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 16:32 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 15:54 -0500
Re: Equivalent halting definitions (identical set) André G. Isaak <agisaak@gm.invalid> - 2021-04-20 15:24 -0600
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 17:31 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 17:02 -0500
Re: Equivalent halting definitions (identical set) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 22:09 +0000
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 19:03 -0500
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 21:52 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 21:57 -0500
Re: Equivalent halting definitions (identical set) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 04:27 +0100
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-20 22:40 -0500
Re: Equivalent halting definitions (identical set) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 14:10 +0100
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-21 09:07 -0500
Re: Equivalent halting definitions (identical set) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 23:54 +0100
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-21 18:48 -0500
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-21 19:06 -0500
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 07:59 -0400
Re: Equivalent halting definitions (identical set) olcott <NoOne@NoWhere.com> - 2021-04-21 09:10 -0500
Re: Equivalent halting definitions (identical set) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 11:24 -0400
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 08:27 -0400
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 15:18 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:28 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:34 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:41 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 11:57 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 11:10 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 12:22 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 11:42 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 14:58 -0400
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 16:51 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 12:02 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 18:46 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 14:20 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 20:24 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 15:36 -0500
Re: Equivalent halting definitions Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-20 22:13 +0000
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 17:25 -0500
Re: Equivalent halting definitions Richard Damon <Richard@Damon-Family.org> - 2021-04-20 15:00 -0400
Re: Equivalent halting definitions olcott <NoOne@NoWhere.com> - 2021-04-20 10:29 -0500
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 11:54 -0400 |
| Message-ID | <SOCfI.4192$IC5.3136@fx24.iad> |
| In reply to | #31575 |
On 4/20/21 11:33 AM, olcott wrote: > On 4/20/2021 7:04 AM, Richard Damon wrote: >> On 4/20/21 12:20 AM, olcott wrote: >>> The set of Turing machine's that would not halt on their input is >>> identical to the set of Turing machines that must have their simulation >>> aborted to prevent their otherwise infinite execution because: >>> >>> (a) Every input having infinite execution would have to have its >>> simulation aborted to prevent its otherwise infinite execution. >>> >>> (b) Every input not having infinite execution not need to have its >>> simulation aborted to prevent infinite execution. >>> >>> Thus the set of inputs that must be aborted to prevent their infinite >>> execution is the exact same set of inputs that have infinite execution >>> and their complementary set is the set of halting computations. >>> >> >> >> Only with the PROPER definition of need to have its simulation aborted. >> >> > > So it must wear a certain kind of bow tie? > > All the computations that would not halt unless the halt decider aborts > their simulation defines the same set as the set of non halting > computations. > > All the computations that would halt without the halt decider aborting > their simulation defines the set of halting computations. > > Only with the right definition of the words. Don't use the definitions that the statements were proved with, you can't use their proofs to establish them as facts. (You DO have proofs of these statement, or is the just a Olcott assumption)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 11:03 -0500 |
| Message-ID | <ToudnWLiUsLZZuP9nZ2dnUU7-T_NnZ2d@giganews.com> |
| In reply to | #31585 |
On 4/20/2021 10:54 AM, Richard Damon wrote: > On 4/20/21 11:33 AM, olcott wrote: >> On 4/20/2021 7:04 AM, Richard Damon wrote: >>> On 4/20/21 12:20 AM, olcott wrote: >>>> The set of Turing machine's that would not halt on their input is >>>> identical to the set of Turing machines that must have their simulation >>>> aborted to prevent their otherwise infinite execution because: >>>> >>>> (a) Every input having infinite execution would have to have its >>>> simulation aborted to prevent its otherwise infinite execution. >>>> >>>> (b) Every input not having infinite execution not need to have its >>>> simulation aborted to prevent infinite execution. >>>> >>>> Thus the set of inputs that must be aborted to prevent their infinite >>>> execution is the exact same set of inputs that have infinite execution >>>> and their complementary set is the set of halting computations. >>>> >>> >>> >>> Only with the PROPER definition of need to have its simulation aborted. >>> >>> >> >> So it must wear a certain kind of bow tie? >> As long as the first part is true >> All the computations that would not halt unless the halt decider aborts >> their simulation then the second part is impossibly false. >> defines the same set as the set of non halting computations. >> All the computations that would halt without the halt decider aborting >> their simulation defines the set of halting computations. >> >> > > Only with the right definition of the words. Who knows maybe by "halts" I mean eat a piece of chocolate birthday cake? Maybe by "set" I mean to put your hair in curlers. > > Don't use the definitions that the statements were proved with, you > can't use their proofs to establish them as facts. > > (You DO have proofs of these statement, or is the just a Olcott assumption) > -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 12:18 -0400 |
| Message-ID | <x9DfI.87003$ST2.84092@fx47.iad> |
| In reply to | #31590 |
On 4/20/21 12:03 PM, olcott wrote: > On 4/20/2021 10:54 AM, Richard Damon wrote: > > > > As long as the first part is true >>> All the computations that would not halt unless the halt decider aborts >>> their simulation > > then the second part is impossibly false. But, it is demonstartably true for H_Hat. Thus your logic is flawed. >>> defines the same set as the set of non halting computations. > >>> All the computations that would halt without the halt decider aborting >>> their simulation defines the set of halting computations. >>> >>> >> >> Only with the right definition of the words. > > Who knows maybe by "halts" I mean eat a piece of chocolate birthday > cake? Maybe by "set" I mean to put your hair in curlers. > Yep, wrong definition gives you nonsense, like if ANY invocation of the Halt Decider anywhere in the chain of execution aborts a simulation the top level program was non-halt. Yep, chocolate birthday cake. >> >> Don't use the definitions that the statements were proved with, you >> can't use their proofs to establish them as facts. >> >> (You DO have proofs of these statement, or is the just a Olcott >> assumption) >> > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 11:38 -0500 |
| Message-ID | <jNCdnYPTjtEJnuL9nZ2dnUU7-LlQAAAA@giganews.com> |
| In reply to | #31595 |
On 4/20/2021 11:18 AM, Richard Damon wrote: > On 4/20/21 12:03 PM, olcott wrote: >> On 4/20/2021 10:54 AM, Richard Damon wrote: >> >> >> >> As long as the first part is true >>>> All the computations that would not halt unless the halt decider aborts >>>> their simulation >> >> then the second part is impossibly false. > > But, it is demonstartably true for H_Hat. That isn't even a complete thought. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 12:48 -0400 |
| Message-ID | <OBDfI.12325$v3H9.5670@fx01.iad> |
| In reply to | #31599 |
On 4/20/21 12:38 PM, olcott wrote: > On 4/20/2021 11:18 AM, Richard Damon wrote: >> On 4/20/21 12:03 PM, olcott wrote: >>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>> >>> >>> >>> As long as the first part is true >>>>> All the computations that would not halt unless the halt decider >>>>> aborts >>>>> their simulation >>> >>> then the second part is impossibly false. >> >> But, it is demonstartably true for H_Hat. > > That isn't even a complete thought. > > H_Hat is demonstrably a Halting Computation given the stipulation that Halts is a Computation and that Halts answers non-halting when asked about the halting of H_Hat(H_Hat). Thus the second case is demonstrably True, and thus the first MUST be False, or you admit your logic system is inconsistent.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 12:44 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <yYOdncr53IecjuL9nZ2dnUU7-fPNnZ2d@giganews.com> |
| In reply to | #31605 |
On 4/20/2021 11:48 AM, Richard Damon wrote: > On 4/20/21 12:38 PM, olcott wrote: >> On 4/20/2021 11:18 AM, Richard Damon wrote: >>> On 4/20/21 12:03 PM, olcott wrote: >>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>> >>>> >>>> >>>> As long as the first part is true >>>>>> All the computations that would not halt unless the halt decider >>>>>> aborts >>>>>> their simulation >>>> >>>> then the second part is impossibly false. >>> >>> But, it is demonstartably true for H_Hat. >> >> That isn't even a complete thought. >> >> > > H_Hat is demonstrably a Halting Computation given the stipulation that > Halts is a Computation and that Halts answers non-halting when asked > about the halting of H_Hat(H_Hat). > > Thus the second case is demonstrably True, and thus the first MUST be > False, or you admit your logic system is inconsistent. > The set of computations that only halt when their simulation is aborted is an identical set to the set of computations that never halt. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 14:57 -0400 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <WuFfI.3037$mT7.802@fx22.iad> |
| In reply to | #31609 |
On 4/20/21 1:44 PM, olcott wrote: > On 4/20/2021 11:48 AM, Richard Damon wrote: >> On 4/20/21 12:38 PM, olcott wrote: >>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>> On 4/20/21 12:03 PM, olcott wrote: >>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>> >>>>> >>>>> >>>>> As long as the first part is true >>>>>>> All the computations that would not halt unless the halt decider >>>>>>> aborts >>>>>>> their simulation >>>>> >>>>> then the second part is impossibly false. >>>> >>>> But, it is demonstartably true for H_Hat. >>> >>> That isn't even a complete thought. >>> >>> >> >> H_Hat is demonstrably a Halting Computation given the stipulation that >> Halts is a Computation and that Halts answers non-halting when asked >> about the halting of H_Hat(H_Hat). >> >> Thus the second case is demonstrably True, and thus the first MUST be >> False, or you admit your logic system is inconsistent. >> > > The set of computations that only halt when their simulation is aborted > is an identical set to the set of computations that never halt. > WRONG. That is only true IF you have a perfect Halt Decider. Prove that you have that first before you use that fact to prove it. This is the circular arguement. The fact tht H_Hat is finite is easy to prove from the stipulations I made. Which one do you disagree with: Is Halts not a computation? Does Nalts(H_Hat, H_Hat) not return non-halting?
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 14:23 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <vtidnUsrGq2qt-L9nZ2dnUU7-aednZ2d@giganews.com> |
| In reply to | #31621 |
On 4/20/2021 1:57 PM, Richard Damon wrote: > On 4/20/21 1:44 PM, olcott wrote: >> On 4/20/2021 11:48 AM, Richard Damon wrote: >>> On 4/20/21 12:38 PM, olcott wrote: >>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>> >>>>>> >>>>>> >>>>>> As long as the first part is true >>>>>>>> All the computations that would not halt unless the halt decider >>>>>>>> aborts >>>>>>>> their simulation >>>>>> >>>>>> then the second part is impossibly false. >>>>> >>>>> But, it is demonstartably true for H_Hat. >>>> >>>> That isn't even a complete thought. >>>> >>>> >>> >>> H_Hat is demonstrably a Halting Computation given the stipulation that >>> Halts is a Computation and that Halts answers non-halting when asked >>> about the halting of H_Hat(H_Hat). >>> >>> Thus the second case is demonstrably True, and thus the first MUST be >>> False, or you admit your logic system is inconsistent. >>> >> >> The set of computations that only halt when their simulation is aborted >> is an identical set to the set of computations that never halt. >> > > WRONG. That is only true IF you have a perfect Halt Decider. Prove that > you have that first before you use that fact to prove it. > When it is proven that set Q has the exactly same elements as set R then this proves that the definition of set Q is equivalent to the definition of set R. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 16:32 -0400 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <VTGfI.89539$ST2.21193@fx47.iad> |
| In reply to | #31628 |
On 4/20/21 3:23 PM, olcott wrote: > On 4/20/2021 1:57 PM, Richard Damon wrote: >> On 4/20/21 1:44 PM, olcott wrote: >>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>> On 4/20/21 12:38 PM, olcott wrote: >>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>> >>>>>>> >>>>>>> >>>>>>> As long as the first part is true >>>>>>>>> All the computations that would not halt unless the halt decider >>>>>>>>> aborts >>>>>>>>> their simulation >>>>>>> >>>>>>> then the second part is impossibly false. >>>>>> >>>>>> But, it is demonstartably true for H_Hat. >>>>> >>>>> That isn't even a complete thought. >>>>> >>>>> >>>> >>>> H_Hat is demonstrably a Halting Computation given the stipulation that >>>> Halts is a Computation and that Halts answers non-halting when asked >>>> about the halting of H_Hat(H_Hat). >>>> >>>> Thus the second case is demonstrably True, and thus the first MUST be >>>> False, or you admit your logic system is inconsistent. >>>> >>> >>> The set of computations that only halt when their simulation is aborted >>> is an identical set to the set of computations that never halt. >>> >> >> WRONG. That is only true IF you have a perfect Halt Decider. Prove that >> you have that first before you use that fact to prove it. >> > > When it is proven that set Q has the exactly same elements as set R then > this proves that the definition of set Q is equivalent to the definition > of set R. > Except it hasn't be provem, in fact with your definition it has been shown that there IS a difference.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 15:54 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <N5idnYef04A-ouL9nZ2dnUU7-IHNnZ2d@giganews.com> |
| In reply to | #31647 |
On 4/20/2021 3:32 PM, Richard Damon wrote: > On 4/20/21 3:23 PM, olcott wrote: >> On 4/20/2021 1:57 PM, Richard Damon wrote: >>> On 4/20/21 1:44 PM, olcott wrote: >>>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>>> On 4/20/21 12:38 PM, olcott wrote: >>>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>>> >>>>>>>> >>>>>>>> >>>>>>>> As long as the first part is true >>>>>>>>>> All the computations that would not halt unless the halt decider >>>>>>>>>> aborts >>>>>>>>>> their simulation >>>>>>>> >>>>>>>> then the second part is impossibly false. >>>>>>> >>>>>>> But, it is demonstartably true for H_Hat. >>>>>> >>>>>> That isn't even a complete thought. >>>>>> >>>>>> >>>>> >>>>> H_Hat is demonstrably a Halting Computation given the stipulation that >>>>> Halts is a Computation and that Halts answers non-halting when asked >>>>> about the halting of H_Hat(H_Hat). >>>>> >>>>> Thus the second case is demonstrably True, and thus the first MUST be >>>>> False, or you admit your logic system is inconsistent. >>>>> >>>> >>>> The set of computations that only halt when their simulation is aborted >>>> is an identical set to the set of computations that never halt. >>>> >>> >>> WRONG. That is only true IF you have a perfect Halt Decider. Prove that >>> you have that first before you use that fact to prove it. >>> >> >> When it is proven that set Q has the exactly same elements as set R then >> this proves that the definition of set Q is equivalent to the definition >> of set R. >> > > Except it hasn't be provem, in fact with your definition it has been > shown that there IS a difference. > Yes it has been shown that the definitions are different. As long as these different definitions define the same set of elements then these different definition are equivalent. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | André G. Isaak <agisaak@gm.invalid> |
|---|---|
| Date | 2021-04-20 15:24 -0600 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <s5ngqa$f8c$1@dont-email.me> |
| In reply to | #31655 |
On 2021-04-20 14:54, olcott wrote: > Yes it has been shown that the definitions are different. > As long as these different definitions define the same set of elements > then these different definition are equivalent. This is rather simplistic. The set of Universal Halt Deciders and the set of even primes which are greater than two both describe the empty set, but I don't think it would be very useful for me to start referring to a Universal Halt Decider as an even prime greater than two. André -- To email remove 'invalid' & replace 'gm' with well known Google mail service.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 17:31 -0400 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <%KHfI.18413$9L1.13202@fx05.iad> |
| In reply to | #31655 |
On 4/20/21 4:54 PM, olcott wrote: > On 4/20/2021 3:32 PM, Richard Damon wrote: >> On 4/20/21 3:23 PM, olcott wrote: >>> On 4/20/2021 1:57 PM, Richard Damon wrote: >>>> On 4/20/21 1:44 PM, olcott wrote: >>>>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>>>> On 4/20/21 12:38 PM, olcott wrote: >>>>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>>>> >>>>>>>>> >>>>>>>>> >>>>>>>>> As long as the first part is true >>>>>>>>>>> All the computations that would not halt unless the halt decider >>>>>>>>>>> aborts >>>>>>>>>>> their simulation >>>>>>>>> >>>>>>>>> then the second part is impossibly false. >>>>>>>> >>>>>>>> But, it is demonstartably true for H_Hat. >>>>>>> >>>>>>> That isn't even a complete thought. >>>>>>> >>>>>>> >>>>>> >>>>>> H_Hat is demonstrably a Halting Computation given the stipulation >>>>>> that >>>>>> Halts is a Computation and that Halts answers non-halting when asked >>>>>> about the halting of H_Hat(H_Hat). >>>>>> >>>>>> Thus the second case is demonstrably True, and thus the first MUST be >>>>>> False, or you admit your logic system is inconsistent. >>>>>> >>>>> >>>>> The set of computations that only halt when their simulation is >>>>> aborted >>>>> is an identical set to the set of computations that never halt. >>>>> >>>> >>>> WRONG. That is only true IF you have a perfect Halt Decider. Prove that >>>> you have that first before you use that fact to prove it. >>>> >>> >>> When it is proven that set Q has the exactly same elements as set R then >>> this proves that the definition of set Q is equivalent to the definition >>> of set R. >>> >> >> Except it hasn't be provem, in fact with your definition it has been >> shown that there IS a difference. >> > > Yes it has been shown that the definitions are different. > As long as these different definitions define the same set of elements > then these different definition are equivalent. > It has been shown that the sets are different. At least one element has moved from one set to the other Boy are you dense.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 17:02 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <0rGdnb5GSMUa0uL9nZ2dnUU7-LHNnZ2d@giganews.com> |
| In reply to | #31660 |
On 4/20/2021 4:31 PM, Richard Damon wrote: > On 4/20/21 4:54 PM, olcott wrote: >> On 4/20/2021 3:32 PM, Richard Damon wrote: >>> On 4/20/21 3:23 PM, olcott wrote: >>>> On 4/20/2021 1:57 PM, Richard Damon wrote: >>>>> On 4/20/21 1:44 PM, olcott wrote: >>>>>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>>>>> On 4/20/21 12:38 PM, olcott wrote: >>>>>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>>>>> >>>>>>>>>> >>>>>>>>>> >>>>>>>>>> As long as the first part is true >>>>>>>>>>>> All the computations that would not halt unless the halt decider >>>>>>>>>>>> aborts >>>>>>>>>>>> their simulation >>>>>>>>>> >>>>>>>>>> then the second part is impossibly false. >>>>>>>>> >>>>>>>>> But, it is demonstartably true for H_Hat. >>>>>>>> >>>>>>>> That isn't even a complete thought. >>>>>>>> >>>>>>>> >>>>>>> >>>>>>> H_Hat is demonstrably a Halting Computation given the stipulation >>>>>>> that >>>>>>> Halts is a Computation and that Halts answers non-halting when asked >>>>>>> about the halting of H_Hat(H_Hat). >>>>>>> >>>>>>> Thus the second case is demonstrably True, and thus the first MUST be >>>>>>> False, or you admit your logic system is inconsistent. >>>>>>> >>>>>> >>>>>> The set of computations that only halt when their simulation is >>>>>> aborted >>>>>> is an identical set to the set of computations that never halt. >>>>>> >>>>> >>>>> WRONG. That is only true IF you have a perfect Halt Decider. Prove that >>>>> you have that first before you use that fact to prove it. >>>>> >>>> >>>> When it is proven that set Q has the exactly same elements as set R then >>>> this proves that the definition of set Q is equivalent to the definition >>>> of set R. >>>> >>> >>> Except it hasn't be provem, in fact with your definition it has been >>> shown that there IS a difference. >>> >> >> Yes it has been shown that the definitions are different. >> As long as these different definitions define the same set of elements >> then these different definition are equivalent. >> > > It has been shown that the sets are different. At least one element has > moved from one set to the other > > > Boy are you dense. > Try and find the differing element: Whether or not a simulated input must have its simulation aborted to prevent its infinite execution <is> equivalent to deciding that an input has infinite execution because (a) and (b) (a) Every input having infinite execution would have to have its simulation aborted to prevent its otherwise infinite execution. (b) Every input not having infinite execution need not have its simulation aborted to prevent infinite execution. Thus the set of inputs that must be aborted to prevent their infinite execution is the exact same set of inputs that have infinite execution. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-20 22:09 +0000 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <20210420150908.411@kylheku.com> |
| In reply to | #31667 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > Whether or not a simulated input must have its simulation aborted to > prevent its infinite execution <is> equivalent to deciding that an input > has infinite execution because (a) and (b) Yeah yeah; whether or not an integer must be incremented by one to make it divisible by two <is> equivalent to whether it is odd.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 19:03 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <PaGdnU26xctC9uL9nZ2dnUU7-VPNnZ2d@giganews.com> |
| In reply to | #31670 |
On 4/20/2021 5:09 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> Whether or not a simulated input must have its simulation aborted to >> prevent its infinite execution <is> equivalent to deciding that an input >> has infinite execution because (a) and (b) > > Yeah yeah; whether or not an integer must be incremented by one > to make it divisible by two <is> equivalent to whether it is odd. > You know that I am correct about this that is why you removed the context. I am going to keep bugging you again and again on this until you give it an accurate critique Try and find the differing element: Whether or not a simulated input must have its simulation aborted to prevent its infinite execution <is> equivalent to deciding that an input has infinite execution because (a) and (b) (a) Every input having infinite execution would have to have its simulation aborted to prevent its otherwise infinite execution. (b) Every input not having infinite execution need not have its simulation aborted to prevent infinite execution. Thus the set of inputs that must be aborted to prevent their infinite execution is the exact same set of inputs that have infinite execution. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 21:52 -0400 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <nALfI.28353$wd1.16967@fx41.iad> |
| In reply to | #31667 |
On 4/20/21 6:02 PM, olcott wrote: > On 4/20/2021 4:31 PM, Richard Damon wrote: >> On 4/20/21 4:54 PM, olcott wrote: >>> On 4/20/2021 3:32 PM, Richard Damon wrote: >>>> On 4/20/21 3:23 PM, olcott wrote: >>>>> On 4/20/2021 1:57 PM, Richard Damon wrote: >>>>>> On 4/20/21 1:44 PM, olcott wrote: >>>>>>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>>>>>> On 4/20/21 12:38 PM, olcott wrote: >>>>>>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> As long as the first part is true >>>>>>>>>>>>> All the computations that would not halt unless the halt >>>>>>>>>>>>> decider >>>>>>>>>>>>> aborts >>>>>>>>>>>>> their simulation >>>>>>>>>>> >>>>>>>>>>> then the second part is impossibly false. >>>>>>>>>> >>>>>>>>>> But, it is demonstartably true for H_Hat. >>>>>>>>> >>>>>>>>> That isn't even a complete thought. >>>>>>>>> >>>>>>>>> >>>>>>>> >>>>>>>> H_Hat is demonstrably a Halting Computation given the stipulation >>>>>>>> that >>>>>>>> Halts is a Computation and that Halts answers non-halting when >>>>>>>> asked >>>>>>>> about the halting of H_Hat(H_Hat). >>>>>>>> >>>>>>>> Thus the second case is demonstrably True, and thus the first >>>>>>>> MUST be >>>>>>>> False, or you admit your logic system is inconsistent. >>>>>>>> >>>>>>> >>>>>>> The set of computations that only halt when their simulation is >>>>>>> aborted >>>>>>> is an identical set to the set of computations that never halt. >>>>>>> >>>>>> >>>>>> WRONG. That is only true IF you have a perfect Halt Decider. Prove >>>>>> that >>>>>> you have that first before you use that fact to prove it. >>>>>> >>>>> >>>>> When it is proven that set Q has the exactly same elements as set R >>>>> then >>>>> this proves that the definition of set Q is equivalent to the >>>>> definition >>>>> of set R. >>>>> >>>> >>>> Except it hasn't be provem, in fact with your definition it has been >>>> shown that there IS a difference. >>>> >>> >>> Yes it has been shown that the definitions are different. >>> As long as these different definitions define the same set of elements >>> then these different definition are equivalent. >>> >> >> It has been shown that the sets are different. At least one element has >> moved from one set to the other >> >> >> Boy are you dense. >> > > Try and find the differing element: > > Whether or not a simulated input must have its simulation aborted to > prevent its infinite execution <is> equivalent to deciding that an input > has infinite execution because (a) and (b) > > (a) Every input having infinite execution would have to have its > simulation aborted to prevent its otherwise infinite execution. > > (b) Every input not having infinite execution need not have its > simulation aborted to prevent infinite execution. > > Thus the set of inputs that must be aborted to prevent their infinite > execution is the exact same set of inputs that have infinite execution. > H_Hat, by the fact that when run as an independent machine (assuming Halts behaves as defined) will be a Halting Computation (yes, it halts because the Halts it used to emulate a H_Hat terminated that emulation and returned a non-halting answer), and thus fall into category (b). By YOUR definition, you claim that Halts needed to abort it to prevent its otherwise infinite execution, so you put it in category (a). (b) != (a) so we have a difference. That, or your function Halts doesn't meet the requirements it needs to in order to be called a Halt Decider.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 21:57 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <D5-dnRi7kOk3CeL9nZ2dnUU7-dWdnZ2d@giganews.com> |
| In reply to | #31718 |
On 4/20/2021 8:52 PM, Richard Damon wrote: > On 4/20/21 6:02 PM, olcott wrote: >> On 4/20/2021 4:31 PM, Richard Damon wrote: >>> On 4/20/21 4:54 PM, olcott wrote: >>>> On 4/20/2021 3:32 PM, Richard Damon wrote: >>>>> On 4/20/21 3:23 PM, olcott wrote: >>>>>> On 4/20/2021 1:57 PM, Richard Damon wrote: >>>>>>> On 4/20/21 1:44 PM, olcott wrote: >>>>>>>> On 4/20/2021 11:48 AM, Richard Damon wrote: >>>>>>>>> On 4/20/21 12:38 PM, olcott wrote: >>>>>>>>>> On 4/20/2021 11:18 AM, Richard Damon wrote: >>>>>>>>>>> On 4/20/21 12:03 PM, olcott wrote: >>>>>>>>>>>> On 4/20/2021 10:54 AM, Richard Damon wrote: >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> >>>>>>>>>>>> As long as the first part is true >>>>>>>>>>>>>> All the computations that would not halt unless the halt >>>>>>>>>>>>>> decider >>>>>>>>>>>>>> aborts >>>>>>>>>>>>>> their simulation >>>>>>>>>>>> >>>>>>>>>>>> then the second part is impossibly false. >>>>>>>>>>> >>>>>>>>>>> But, it is demonstartably true for H_Hat. >>>>>>>>>> >>>>>>>>>> That isn't even a complete thought. >>>>>>>>>> >>>>>>>>>> >>>>>>>>> >>>>>>>>> H_Hat is demonstrably a Halting Computation given the stipulation >>>>>>>>> that >>>>>>>>> Halts is a Computation and that Halts answers non-halting when >>>>>>>>> asked >>>>>>>>> about the halting of H_Hat(H_Hat). >>>>>>>>> >>>>>>>>> Thus the second case is demonstrably True, and thus the first >>>>>>>>> MUST be >>>>>>>>> False, or you admit your logic system is inconsistent. >>>>>>>>> >>>>>>>> >>>>>>>> The set of computations that only halt when their simulation is >>>>>>>> aborted >>>>>>>> is an identical set to the set of computations that never halt. >>>>>>>> >>>>>>> >>>>>>> WRONG. That is only true IF you have a perfect Halt Decider. Prove >>>>>>> that >>>>>>> you have that first before you use that fact to prove it. >>>>>>> >>>>>> >>>>>> When it is proven that set Q has the exactly same elements as set R >>>>>> then >>>>>> this proves that the definition of set Q is equivalent to the >>>>>> definition >>>>>> of set R. >>>>>> >>>>> >>>>> Except it hasn't be provem, in fact with your definition it has been >>>>> shown that there IS a difference. >>>>> >>>> >>>> Yes it has been shown that the definitions are different. >>>> As long as these different definitions define the same set of elements >>>> then these different definition are equivalent. >>>> >>> >>> It has been shown that the sets are different. At least one element has >>> moved from one set to the other >>> >>> >>> Boy are you dense. >>> >> >> Try and find the differing element: >> >> Whether or not a simulated input must have its simulation aborted to >> prevent its infinite execution <is> equivalent to deciding that an input >> has infinite execution because (a) and (b) >> >> (a) Every input having infinite execution would have to have its >> simulation aborted to prevent its otherwise infinite execution. >> >> (b) Every input not having infinite execution need not have its >> simulation aborted to prevent infinite execution. >> >> Thus the set of inputs that must be aborted to prevent their infinite >> execution is the exact same set of inputs that have infinite execution. >> > > H_Hat, by the fact Is an off topic dodge of this point: Computations that only halted because the halt decider correctly decided that their simulation must be aborted to prevent their otherwise infinite execution define the exact same set of elements as the set of non-halting computations. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-21 04:27 +0100 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <87wnswtiz5.fsf@bsb.me.uk> |
| In reply to | #31723 |
olcott <NoOne@NoWhere.com> writes: > Computations that only halted because the halt decider correctly > decided that their simulation must be aborted to prevent their > otherwise infinite execution define the exact same set of elements as > the set of non-halting computations. You must think that attributing agency and purpose to a state transition function (AKA a TM) will allow you to get away with writing patent nonsense. A "computation that only halted because <reason>" is a computation that halted. Apparently the set of these very special finite computations is the same as the set of non-halting computations. This is nonsense, but it is at least crystal clear nonsense. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 22:40 -0500 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <15udneABN9w3A-L9nZ2dnUU7-fXNnZ2d@giganews.com> |
| In reply to | #31729 |
On 4/20/2021 10:27 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> Computations that only halted because the halt decider correctly >> decided that their simulation must be aborted to prevent their >> otherwise infinite execution define the exact same set of elements as >> the set of non-halting computations. > > You must think that attributing agency and purpose to a state transition > function (AKA a TM) will allow you to get away with writing patent > nonsense. > > A "computation that only halted because <reason>" is a computation that > halted. Yes that is true. Perhaps set theory is over your head. > Apparently the set of these very special finite computations is > the same as the set of non-halting computations. This is nonsense, but > it is at least crystal clear nonsense. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-21 14:10 +0100 |
| Subject | Re: Equivalent halting definitions (identical set) |
| Message-ID | <87fszjwzph.fsf@bsb.me.uk> |
| In reply to | #31730 |
olcott <NoOne@NoWhere.com> writes: > On 4/20/2021 10:27 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> Computations that only halted because the halt decider correctly >>> decided that their simulation must be aborted to prevent their >>> otherwise infinite execution define the exact same set of elements as >>> the set of non-halting computations. >> >> You must think that attributing agency and purpose to a state transition >> function (AKA a TM) will allow you to get away with writing patent >> nonsense. >> >> A "computation that only halted because <reason>" is a computation that >> halted. > > Yes that is true. > > Perhaps set theory is over your head. Yes, a lot of it is. I never really understood the different large cardinal axioms for example. >> Apparently the set of these very special finite computations is >> the same as the set of non-halting computations. Is this sentence over yours? If you are not trying to say that the preceding sentence defines the same set of computations as the non-halting ones, then you need to hone your writing skills. If you are trying to say that, you need to hone your logic skills. A strange possibility occurs to me. Could it be that you think you can declare, by fiat, that these halted, finite computations are in fact non-halting? Surely not. Not even God can make the even numbers odd. -- Ben.
[toc] | [prev] | [next] | [standalone]
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
Back to top | Article view | comp.theory
csiph-web