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 | 7 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 4 of 4 — ← Prev page 1 2 3 [4]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 14:20 -0500 |
| Message-ID | <vtidnUkrGq0atOL9nZ2dnUU7-afNnZ2d@giganews.com> |
| In reply to | #31617 |
On 4/20/2021 1:46 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>> Because the set of computations that my decider recognizes is the same >>>> set as the set of computations having infinite execution my decider <is> >>>> a halt decider: > > That says, "I have a full decider". > >>> So you're claiming you have a universal halt decider now? >>> >>> You've been saying that this is expressly not your goal, but only to >>> refute the counter-example-generating mechanism used in some proofs. >>> >> >> After I have made the same qualifications to my claim over and over I >> quit expressly stating them. I have a partial halt decider that correct > > That contradicts "I have a fulld decider". > I do not have a full decider. >> decide that some inputs express infinitely recursive behavior. > > That just means it *incorrectly* decides some other inputs. It means > nothing. > When it is proven that set Q has the exactly same elements as set R then this proves that the definition of set R is equivalent to the definition of set Q. -- 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 20:24 +0000 |
| Message-ID | <20210420132410.946@kylheku.com> |
| In reply to | #31626 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > On 4/20/2021 1:46 PM, Kaz Kylheku wrote: >> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>> On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>> Because the set of computations that my decider recognizes is the same >>>>> set as the set of computations having infinite execution my decider <is> >>>>> a halt decider: >> >> That says, "I have a full decider". >> >>>> So you're claiming you have a universal halt decider now? >>>> >>>> You've been saying that this is expressly not your goal, but only to >>>> refute the counter-example-generating mechanism used in some proofs. >>>> >>> >>> After I have made the same qualifications to my claim over and over I >>> quit expressly stating them. I have a partial halt decider that correct >> >> That contradicts "I have a fulld decider". >> > > I do not have a full decider. > >>> decide that some inputs express infinitely recursive behavior. >> >> That just means it *incorrectly* decides some other inputs. It means >> nothing. >> > > When it is proven that set Q has the exactly same elements as set R then > this proves that the definition of set R is equivalent to the definition > of set Q. Sadly, no such thing has been proven.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 15:36 -0500 |
| Message-ID | <avudnca_QqrVpuL9nZ2dnUU7-e2dnZ2d@giganews.com> |
| In reply to | #31642 |
On 4/20/2021 3:24 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> On 4/20/2021 1:46 PM, Kaz Kylheku wrote: >>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> Because the set of computations that my decider recognizes is the same >>>>>> set as the set of computations having infinite execution my decider <is> >>>>>> a halt decider: >>> >>> That says, "I have a full decider". >>> >>>>> So you're claiming you have a universal halt decider now? >>>>> >>>>> You've been saying that this is expressly not your goal, but only to >>>>> refute the counter-example-generating mechanism used in some proofs. >>>>> >>>> >>>> After I have made the same qualifications to my claim over and over I >>>> quit expressly stating them. I have a partial halt decider that correct >>> >>> That contradicts "I have a fulld decider". >>> >> >> I do not have a full decider. >> >>>> decide that some inputs express infinitely recursive behavior. >>> >>> That just means it *incorrectly* decides some other inputs. It means >>> nothing. >>> >> >> When it is proven that set Q has the exactly same elements as set R then >> this proves that the definition of set R is equivalent to the definition >> of set Q. > > Sadly, no such thing has been proven. > I had to state the basis of the proof before I stated the proof because your bias wuold cause you to reject the proof without even looking at it. Do you agree that the above basis of the proof is correct? -- 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:13 +0000 |
| Message-ID | <20210420151229.37@kylheku.com> |
| In reply to | #31651 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > On 4/20/2021 3:24 PM, Kaz Kylheku wrote: >> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>> On 4/20/2021 1:46 PM, Kaz Kylheku wrote: >>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>> On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >>>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>>>> Because the set of computations that my decider recognizes is the same >>>>>>> set as the set of computations having infinite execution my decider <is> >>>>>>> a halt decider: >>>> >>>> That says, "I have a full decider". >>>> >>>>>> So you're claiming you have a universal halt decider now? >>>>>> >>>>>> You've been saying that this is expressly not your goal, but only to >>>>>> refute the counter-example-generating mechanism used in some proofs. >>>>>> >>>>> >>>>> After I have made the same qualifications to my claim over and over I >>>>> quit expressly stating them. I have a partial halt decider that correct >>>> >>>> That contradicts "I have a fulld decider". >>>> >>> >>> I do not have a full decider. >>> >>>>> decide that some inputs express infinitely recursive behavior. >>>> >>>> That just means it *incorrectly* decides some other inputs. It means >>>> nothing. >>>> >>> >>> When it is proven that set Q has the exactly same elements as set R then >>> this proves that the definition of set R is equivalent to the definition >>> of set Q. >> >> Sadly, no such thing has been proven. >> > > I had to state the basis of the proof before I stated the proof because > your bias wuold cause you to reject the proof without even looking at it. I'm biased toward deductive arguments whose premises are true. > Do you agree that the above basis of the proof is correct? I don't see anything resembling a "basis" or a "proof". -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 17:25 -0500 |
| Message-ID | <coOdnfq9qchryeL9nZ2dnUU78e2dnZ2d@giganews.com> |
| In reply to | #31673 |
On 4/20/2021 5:13 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> On 4/20/2021 3:24 PM, Kaz Kylheku wrote: >>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/20/2021 1:46 PM, Kaz Kylheku wrote: >>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>>> On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >>>>>>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>>>>>> Because the set of computations that my decider recognizes is the same >>>>>>>> set as the set of computations having infinite execution my decider <is> >>>>>>>> a halt decider: >>>>> >>>>> That says, "I have a full decider". >>>>> >>>>>>> So you're claiming you have a universal halt decider now? >>>>>>> >>>>>>> You've been saying that this is expressly not your goal, but only to >>>>>>> refute the counter-example-generating mechanism used in some proofs. >>>>>>> >>>>>> >>>>>> After I have made the same qualifications to my claim over and over I >>>>>> quit expressly stating them. I have a partial halt decider that correct >>>>> >>>>> That contradicts "I have a fulld decider". >>>>> >>>> >>>> I do not have a full decider. >>>> >>>>>> decide that some inputs express infinitely recursive behavior. >>>>> >>>>> That just means it *incorrectly* decides some other inputs. It means >>>>> nothing. >>>>> >>>> >>>> When it is proven that set Q has the exactly same elements as set R then >>>> this proves that the definition of set R is equivalent to the definition >>>> of set Q. >>> >>> Sadly, no such thing has been proven. >>> >> >> I had to state the basis of the proof before I stated the proof because >> your bias wuold cause you to reject the proof without even looking at it. > > I'm biased toward deductive arguments whose premises are true. > >> Do you agree that the above basis of the proof is correct? > > I don't see anything resembling a "basis" or a "proof". > Do you see any error here: When it is proven that set Q has the exactly same elements as set R then this proves that the definition of set R is equivalent to the definition of set Q. -- 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 15:00 -0400 |
| Message-ID | <vxFfI.3039$mT7.300@fx22.iad> |
| In reply to | #31607 |
On 4/20/21 1:02 PM, olcott wrote: > On 4/20/2021 11:51 AM, Kaz Kylheku wrote: >> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>> On 4/20/2021 10:18 AM, Kaz Kylheku wrote: >>>> On 2021-04-20, olcott <NoOne@NoWhere.com> 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. >>>> >>>> Your brilliance inspires others to want to shine also. >>>> Here is my attempt: >>>> >>>> The set of integers that are odd is identical to the set of integers >>>> that must be increased by one in order to be divisible by two. >>>> >>>> (a) every integer being odd has be increased by 1 so that >>>> it is evenly divisible by two. >>>> >>>> (b) every integer not being odd need not be increased to be >>>> to be evenly divisible by two. >>>> >>> >>> Because the set of computations that my decider recognizes is the same >>> set as the set of computations having infinite execution my decider <is> >>> a halt decider: >> >> So you're claiming you have a universal halt decider now? >> >> You've been saying that this is expressly not your goal, but only to >> refute the counter-example-generating mechanism used in some proofs. >> > > After I have made the same qualifications to my claim over and over I > quit expressly stating them. I have a partial halt decider that correct > decide that some inputs express infinitely recursive behavior. It may detect potentially infinitely recursive unless it stops them at some level. It does NOT decide actual Halting per the definition of Computation Theory. > >>> I can transform one definition into another equivalent definition. >> >> That's no small feat for someone who doesn't understand or respect >> definitions. >> >>> 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) > > You cannot properly critique my position by making sure to ignore key > elements of this position. > > When set Q is proved to have the exact same elements as set R that > proves that the separate definitions of these two sets are equivalent to > each other. > > Except that H_Hat is shown to be in different categories by the two definition (at least the way YOU are defining them), therefore they are not equal.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 10:29 -0500 |
| Message-ID | <deqdnbJ1i-SibuP9nZ2dnUU7-QGdnZ2d@giganews.com> |
| In reply to | #31546 |
On 4/20/2021 7:46 AM, Bonita Montero wrote: > STOP POSTING THIS STUFF in comp.lang.c/c++ ! KNOW ! -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [standalone]
Page 4 of 4 — ← Prev page 1 2 3 [4]
Back to top | Article view | comp.theory
csiph-web