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 1 of 4 [1] 2 3 4 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 23:20 -0500 |
| Subject | Equivalent halting definitions |
| Message-ID | <hLSdndSOyuMFy-P9nZ2dnUU7-fXNnZ2d@giganews.com> |
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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [next] | [standalone]
| From | "dklei...@gmail.com" <dkleinecke@gmail.com> |
|---|---|
| Date | 2021-04-19 22:21 -0700 |
| Message-ID | <c2dd617a-c3af-40fa-b9cb-b4d026899d38n@googlegroups.com> |
| In reply to | #31546 |
On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. Fiddle-dee-dee. All you have said is: If a Turing machine that would not halt with some specific input is simulated that simulation will never complete its run and must be somehow aborted. Not news.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 10:26 -0500 |
| Message-ID | <deqdnbB1i-QAb-P9nZ2dnUU7-QHNnZ2d@giganews.com> |
| In reply to | #31556 |
On 4/20/2021 12:21 AM, dklei...@gmail.com wrote: > On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. > > Fiddle-dee-dee. All you have said is: If a Turing machine that would not > halt with some specific input is simulated that simulation will never > complete its run and must be somehow aborted. > > Not news. > I can transform one definition into another equivalent definition. The elements of the set of computations that only halt because the halt decider aborts their simulation is the exact same set of computations having infinite execution. Because it is defines the same set as the set of non-halting computations it directly applies to the halting problem undecidability proofs. 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 11:33 -0400 |
| Message-ID | <9vCfI.3031$mT7.539@fx22.iad> |
| In reply to | #31572 |
On 4/20/21 11:26 AM, olcott wrote: > On 4/20/2021 12:21 AM, dklei...@gmail.com wrote: >> On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. >> Fiddle-dee-dee. All you have said is: If a Turing machine that would >> not >> halt with some specific input is simulated that simulation will never >> complete its run and must be somehow aborted. >> >> Not news. >> > > I can transform one definition into another equivalent definition. But only if the definitions are TRULY equivalent, and you continue to use the words in that equivelent meaning > > The elements of the set of computations that only halt because the halt > decider aborts their simulation is the exact same set of computations > having infinite execution. > > Because it is defines the same set as the set of non-halting > computations it directly applies to the halting problem undecidability > proofs. > > 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. > And for this definition, it implies that 'its simulation aborted' is refering only to the top level simulator (not any other copies that might exist in the computation) and when testing that you change ONLY that top level simulator. You refuse to do that, so you are using a different definition, so the sets are not equivalent, as has been shown.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 10:40 -0500 |
| Message-ID | <ve-dnW8m_LBOaOP9nZ2dnUU7-VvNnZ2d@giganews.com> |
| In reply to | #31576 |
On 4/20/2021 10:33 AM, Richard Damon wrote: > On 4/20/21 11:26 AM, olcott wrote: >> On 4/20/2021 12:21 AM, dklei...@gmail.com wrote: >>> On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. >>> Fiddle-dee-dee. All you have said is: If a Turing machine that would >>> not >>> halt with some specific input is simulated that simulation will never >>> complete its run and must be somehow aborted. >>> >>> Not news. >>> >> >> I can transform one definition into another equivalent definition. > > But only if the definitions are TRULY equivalent, and you continue to > use the words in that equivelent meaning >> >> The elements of the set of computations that only halt because the halt >> decider aborts their simulation is the exact same set of computations >> having infinite execution. >> >> Because it is defines the same set as the set of non-halting >> computations it directly applies to the halting problem undecidability >> proofs. >> >> 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. >> > > And for this definition, it implies that 'its simulation aborted' is > refering only to the top level simulator (not any other copies that > might exist in the computation) and when testing that you change ONLY > that top level simulator. I am not changing any simulator. When a simulation is aborted that means that the next instruction after the one where H_Hat() calls Halts() a second time is never simulated. > You refuse to do that, so you are using a different definition, so the > sets are not equivalent, as has been shown. > -- 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 11:52 -0400 |
| Message-ID | <aNCfI.4191$IC5.3966@fx24.iad> |
| In reply to | #31580 |
On 4/20/21 11:40 AM, olcott wrote: > On 4/20/2021 10:33 AM, Richard Damon wrote: >> On 4/20/21 11:26 AM, olcott wrote: >>> On 4/20/2021 12:21 AM, dklei...@gmail.com wrote: >>>> On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. >>>> Fiddle-dee-dee. All you have said is: If a Turing machine that would >>>> not >>>> halt with some specific input is simulated that simulation will never >>>> complete its run and must be somehow aborted. >>>> >>>> Not news. >>>> >>> >>> I can transform one definition into another equivalent definition. >> >> But only if the definitions are TRULY equivalent, and you continue to >> use the words in that equivelent meaning >>> >>> The elements of the set of computations that only halt because the halt >>> decider aborts their simulation is the exact same set of computations >>> having infinite execution. >>> >>> Because it is defines the same set as the set of non-halting >>> computations it directly applies to the halting problem undecidability >>> proofs. >>> >>> 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. >>> >> >> And for this definition, it implies that 'its simulation aborted' is >> refering only to the top level simulator (not any other copies that >> might exist in the computation) and when testing that you change ONLY >> that top level simulator. > > I am not changing any simulator. When a simulation is aborted that means > that the next instruction after the one where H_Hat() calls Halts() a > second time is never simulated. > But to TEST if that answer is correct, the way to test it is to make that simulator not abort, and see if it was right, and the computation never stops. The fact that H_Hat WILL stop when you change JUST the top level simulator says that the simulator was WRONG, and IT didn't need to stop the simulation to keep the computation from going on forever. >> You refuse to do that, so you are using a different definition, so the >> sets are not equivalent, as has been shown. >> > > > >
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 10:59 -0500 |
| Message-ID | <U46dnRSez7jNZ-P9nZ2dnUU7-KvNnZ2d@giganews.com> |
| In reply to | #31584 |
On 4/20/2021 10:52 AM, Richard Damon wrote: > On 4/20/21 11:40 AM, olcott wrote: >> On 4/20/2021 10:33 AM, Richard Damon wrote: >>> On 4/20/21 11:26 AM, olcott wrote: >>>> On 4/20/2021 12:21 AM, dklei...@gmail.com wrote: >>>>> On Monday, April 19, 2021 at 9:20:47 PM UTC-7, 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. >>>>> Fiddle-dee-dee. All you have said is: If a Turing machine that would >>>>> not >>>>> halt with some specific input is simulated that simulation will never >>>>> complete its run and must be somehow aborted. >>>>> >>>>> Not news. >>>>> >>>> >>>> I can transform one definition into another equivalent definition. >>> >>> But only if the definitions are TRULY equivalent, and you continue to >>> use the words in that equivelent meaning >>>> >>>> The elements of the set of computations that only halt because the halt >>>> decider aborts their simulation is the exact same set of computations >>>> having infinite execution. >>>> >>>> Because it is defines the same set as the set of non-halting >>>> computations it directly applies to the halting problem undecidability >>>> proofs. >>>> >>>> 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. >>>> >>> >>> And for this definition, it implies that 'its simulation aborted' is >>> refering only to the top level simulator (not any other copies that >>> might exist in the computation) and when testing that you change ONLY >>> that top level simulator. >> >> I am not changing any simulator. When a simulation is aborted that means >> that the next instruction after the one where H_Hat() calls Halts() a >> second time is never simulated. >> > > But to TEST if that answer is correct, the way to test it is to make > that simulator not abort, and see if it was right, and the computation > never stops. Yes is we totally remove the ability to abort any computation from the halt decider and rerun the comppution and the computation never halts this proves that it was right. > The fact that H_Hat WILL stop when you change JUST the top > level simulator says that the simulator was WRONG, and IT didn't need to > stop the simulation to keep the computation from going on forever. > >>> You refuse to do that, so you are using a different definition, so the >>> sets are not equivalent, as has been shown. >>> >> >> >> >> > -- 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:16 -0400 |
| Message-ID | <67DfI.87002$ST2.12141@fx47.iad> |
| In reply to | #31588 |
On 4/20/21 11:59 AM, olcott wrote: > On 4/20/2021 10:52 AM, Richard Damon wrote: > >> But to TEST if that answer is correct, the way to test it is to make >> that simulator not abort, and see if it was right, and the computation >> never stops. > > Yes is we totally remove the ability to abort any computation from the > halt decider and rerun the comppution and the computation never halts > this proves that it was right. > Totally remove the ability from the TOP LEVEL ONLY. THAT is the definition. The computation on the tape must still stay the same. THAT is you fundamental error and conflating of machines.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 11:37 -0500 |
| Message-ID | <jNCdnYDTjtGwnuL9nZ2dnUU7-LnNnZ2d@giganews.com> |
| In reply to | #31594 |
On 4/20/2021 11:16 AM, Richard Damon wrote: > On 4/20/21 11:59 AM, olcott wrote: >> On 4/20/2021 10:52 AM, Richard Damon wrote: >> >>> But to TEST if that answer is correct, the way to test it is to make >>> that simulator not abort, and see if it was right, and the computation >>> never stops. >> >> Yes is we totally remove the ability to abort any computation from the >> halt decider and rerun the comppution and the computation never halts >> this proves that it was right. >> > > Totally remove the ability from the TOP LEVEL ONLY. THAT is the > definition. The computation on the tape must still stay the same. > > THAT is you fundamental error and conflating of machines. > Two murderous guys from the same gang want to kill you and are at your house now to kill you. According to your reasoning if you remove the deadly weapons from one of the guys then you are totally safe. -- 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:46 -0400 |
| Message-ID | <ezDfI.12324$v3H9.299@fx01.iad> |
| In reply to | #31598 |
On 4/20/21 12:37 PM, olcott wrote: > On 4/20/2021 11:16 AM, Richard Damon wrote: >> On 4/20/21 11:59 AM, olcott wrote: >>> On 4/20/2021 10:52 AM, Richard Damon wrote: >>> >>>> But to TEST if that answer is correct, the way to test it is to make >>>> that simulator not abort, and see if it was right, and the computation >>>> never stops. >>> >>> Yes is we totally remove the ability to abort any computation from the >>> halt decider and rerun the comppution and the computation never halts >>> this proves that it was right. >>> >> >> Totally remove the ability from the TOP LEVEL ONLY. THAT is the >> definition. The computation on the tape must still stay the same. >> >> THAT is you fundamental error and conflating of machines. >> > > Two murderous guys from the same gang want to kill you and are at your > house now to kill you. According to your reasoning if you remove the > deadly weapons from one of the guys then you are totally safe. > > Nope. Bad analogy. The second guy only has a water pistol so you don't need to worry about him. The X() invoked by Y() does not have the power to terminate the calling Y() (without breaking its contract).
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 12:56 -0500 |
| Message-ID | <jcqdnRNggu4oiOL9nZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #31603 |
On 4/20/2021 11:46 AM, Richard Damon wrote: > On 4/20/21 12:37 PM, olcott wrote: >> On 4/20/2021 11:16 AM, Richard Damon wrote: >>> On 4/20/21 11:59 AM, olcott wrote: >>>> On 4/20/2021 10:52 AM, Richard Damon wrote: >>>> >>>>> But to TEST if that answer is correct, the way to test it is to make >>>>> that simulator not abort, and see if it was right, and the computation >>>>> never stops. >>>> >>>> Yes is we totally remove the ability to abort any computation from the >>>> halt decider and rerun the comppution and the computation never halts >>>> this proves that it was right. >>>> >>> >>> Totally remove the ability from the TOP LEVEL ONLY. THAT is the >>> definition. The computation on the tape must still stay the same. >>> >>> THAT is you fundamental error and conflating of machines. >>> >> >> Two murderous guys from the same gang want to kill you and are at your >> house now to kill you. According to your reasoning if you remove the >> deadly weapons from one of the guys then you are totally safe. >> >> > > Nope. Bad analogy. The second guy only has a water pistol so you don't > need to worry about him. The X() invoked by Y() does not have the power > to terminate the calling Y() (without breaking its contract). > X() simulates Y() simulates X() The original X() has the power to terminate Y() thus terminating the whole call chain of Y(). Y() simulates X() simulates Y() simulates X() The first X() has the power to terminate the second Y() thus terminating the whole call chain of the second Y(). The only reason that Y() ever terminates is that X() stops simulating it at some point. -- 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 18:42 +0000 |
| Message-ID | <20210420113133.850@kylheku.com> |
| In reply to | #31610 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > On 4/20/2021 11:46 AM, Richard Damon wrote: >> Nope. Bad analogy. The second guy only has a water pistol so you don't >> need to worry about him. The X() invoked by Y() does not have the power >> to terminate the calling Y() (without breaking its contract). >> > > X() simulates Y() simulates X() > The original X() has the power to terminate Y() thus terminating the > whole call chain of Y(). If X is called with the same arguments twice, and behaves differently (for instance, on the first call it doesn't terminate, and on the second one it does) then it is not a function. One of your premises is that that X must be called twice from Y with the same arguments. That implies that X makes no decision to terminate. Whatever decision it makes has to be made on its first call, because the second call cannot turn out differently from the first call. If X stores information such as execution traces in a global variable which is shared by all invocations of X, it is not a function of its arguments. It has a hidden argument: the global state containing those traces. That violates the rule that X is called twice with the same arguments. It's called twice with only the same formal arguments declared in its procedure header, but the hidden ad-hoc argument that is the global state is changing. Functions are Turing-complete. Everything result we can prove about computability using recursive functions holds for Turing machines, and holds for imperative procedures also. It is completely general. We can use functions to analyze any situation involving imperative procedures. We just have to convert their computation into functions. The proof you're trying to dispute works with recursive functions. You must follow its conditions and use functions. You must have a rule (0) which says: X() and Y() are functions of their formal arguments, and nothing else; X() and Y() are not "functions" in the sense of "C language function", which refers to an imperative procedure. When you add that rule, it's clear that X() cannot be called twice with the same arguments, such that it makes a different decision on the second call. Thus the conclusion is that there is runaway recursion; there is no possibility of anything else as long as the "X called twice" premise is asserted. -- 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 14:28 -0500 |
| Message-ID | <2rCdnSlqlKDFtuL9nZ2dnUU7-bfNnZ2d@giganews.com> |
| In reply to | #31615 |
On 4/20/2021 1:42 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> On 4/20/2021 11:46 AM, Richard Damon wrote: >>> Nope. Bad analogy. The second guy only has a water pistol so you don't >>> need to worry about him. The X() invoked by Y() does not have the power >>> to terminate the calling Y() (without breaking its contract). >>> >> >> X() simulates Y() simulates X() >> The original X() has the power to terminate Y() thus terminating the >> whole call chain of Y(). > > If X is called with the same arguments twice, and behaves differently > (for instance, on the first call it doesn't terminate, and on the second > one it does) then it is not a function. > > One of your premises is that that X must be called twice from Y > with the same arguments. > > That implies that X makes no decision to terminate. That is a ridculously foolish thing to say. That I did not have a peanut butter and jelly sandwich today does not prove that I will never have a peanut butter an jelly sandwich at any time in the rest of my life. -- 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:23 +0000 |
| Message-ID | <20210420131847.99@kylheku.com> |
| In reply to | #31629 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > On 4/20/2021 1:42 PM, Kaz Kylheku wrote: >> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>> On 4/20/2021 11:46 AM, Richard Damon wrote: >>>> Nope. Bad analogy. The second guy only has a water pistol so you don't >>>> need to worry about him. The X() invoked by Y() does not have the power >>>> to terminate the calling Y() (without breaking its contract). >>>> >>> >>> X() simulates Y() simulates X() >>> The original X() has the power to terminate Y() thus terminating the >>> whole call chain of Y(). >> >> If X is called with the same arguments twice, and behaves differently >> (for instance, on the first call it doesn't terminate, and on the second >> one it does) then it is not a function. >> >> One of your premises is that that X must be called twice from Y >> with the same arguments. >> >> That implies that X makes no decision to terminate. > > That is a ridculously foolish thing to say. You are not qualified to detect when I've actually written a ridiculously foolish thing; if I dod that here, I can depend on Ben and others. > That I did not have a peanut butter and jelly sandwich today does not > prove that I will never have a peanut butter an jelly sandwich at any > time in the rest of my life. That is actually true if the decision is a pure function. It can be one; for instance, if you're fatally allergic to peanut butter, then that function is a probably going to be a constant "no, I will not have one". Probably likewise if you simply hate peanut butter and jelly. For other people, the decision to have a peanut butter and jam sandwich is a function of a vast amount of state which is always churning, and not a matter of several mathematically precise arguments that can be pinned down, including external state like whether peanut butter, jelly and bread are simultaneously available. Note that rearranging analogies, word semantics and prejudices in your head is not the same as thinking. -- 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 15:34 -0500 |
| Message-ID | <avudnce_QqpLp-L9nZ2dnUU7-e3NnZ2d@giganews.com> |
| In reply to | #31641 |
On 4/20/2021 3:23 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> On 4/20/2021 1:42 PM, Kaz Kylheku wrote: >>> On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >>>> On 4/20/2021 11:46 AM, Richard Damon wrote: >>>>> Nope. Bad analogy. The second guy only has a water pistol so you don't >>>>> need to worry about him. The X() invoked by Y() does not have the power >>>>> to terminate the calling Y() (without breaking its contract). >>>>> >>>> >>>> X() simulates Y() simulates X() >>>> The original X() has the power to terminate Y() thus terminating the >>>> whole call chain of Y(). >>> >>> If X is called with the same arguments twice, and behaves differently >>> (for instance, on the first call it doesn't terminate, and on the second >>> one it does) then it is not a function. >>> >>> One of your premises is that that X must be called twice from Y >>> with the same arguments. >>> >>> That implies that X makes no decision to terminate. >> >> That is a ridculously foolish thing to say. > > You are not qualified to detect when I've actually written a > ridiculously foolish thing; if I dod that here, I can depend on Ben and > others. > >> That I did not have a peanut butter and jelly sandwich today does not >> prove that I will never have a peanut butter an jelly sandwich at any >> time in the rest of my life. > > That is actually true if the decision is a pure function. It can be one; > for instance, if you're fatally allergic to peanut butter, then that > function is a probably going to be a constant "no, I will not have one". > Probably likewise if you simply hate peanut butter and jelly. > > For other people, the decision to have a peanut butter and jam sandwich > is a function of a vast amount of state which is always churning, and > not a matter of several mathematically precise arguments that can be > pinned down, including external state like whether peanut butter, jelly > and bread are simultaneously available. > > Note that rearranging analogies, word semantics and prejudices in your > head is not the same as thinking. > The partial halt decider always decides to terminate the simulation of its input as soon as it has a sufficient basis for making this decision. -- 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:12 +0000 |
| Message-ID | <20210420151022.290@kylheku.com> |
| In reply to | #31649 |
On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: > The partial halt decider always decides to terminate the simulation of > its input as soon as it has a sufficient basis for making this decision. Problem is, that basis is a bunch of global state not carried in its functional arguments, yet you have a premise in your argument that it's called with the same inputs. -- 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:24 -0500 |
| Message-ID | <coOdnfu9qcg0yeL9nZ2dnUU78e1QAAAA@giganews.com> |
| In reply to | #31672 |
On 4/20/2021 5:12 PM, Kaz Kylheku wrote: > On 2021-04-20, olcott <NoOne@NoWhere.com> wrote: >> The partial halt decider always decides to terminate the simulation of >> its input as soon as it has a sufficient basis for making this decision. > > Problem is, that basis is a bunch of global state not carried in its > functional arguments, yet you have a premise in your argument that it's > called with the same inputs. > We have been through this too many times with you simply ignoring what I say. All of the computations that the Sipser H does based on its input are a pure function of this input even when it simulates the Sipser D invoking H. -- 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:54 -0400 |
| Message-ID | <ArFfI.3036$mT7.1325@fx22.iad> |
| In reply to | #31610 |
On 4/20/21 1:56 PM, olcott wrote: > On 4/20/2021 11:46 AM, Richard Damon wrote: >> On 4/20/21 12:37 PM, olcott wrote: >>> On 4/20/2021 11:16 AM, Richard Damon wrote: >>>> On 4/20/21 11:59 AM, olcott wrote: >>>>> On 4/20/2021 10:52 AM, Richard Damon wrote: >>>>> >>>>>> But to TEST if that answer is correct, the way to test it is to make >>>>>> that simulator not abort, and see if it was right, and the >>>>>> computation >>>>>> never stops. >>>>> >>>>> Yes is we totally remove the ability to abort any computation from the >>>>> halt decider and rerun the comppution and the computation never halts >>>>> this proves that it was right. >>>>> >>>> >>>> Totally remove the ability from the TOP LEVEL ONLY. THAT is the >>>> definition. The computation on the tape must still stay the same. >>>> >>>> THAT is you fundamental error and conflating of machines. >>>> >>> >>> Two murderous guys from the same gang want to kill you and are at your >>> house now to kill you. According to your reasoning if you remove the >>> deadly weapons from one of the guys then you are totally safe. >>> >>> >> >> Nope. Bad analogy. The second guy only has a water pistol so you don't >> need to worry about him. The X() invoked by Y() does not have the power >> to terminate the calling Y() (without breaking its contract). >> > > X() simulates Y() simulates X() > The original X() has the power to terminate Y() thus terminating the > whole call chain of Y(). > > Y() simulates X() simulates Y() simulates X() > The first X() has the power to terminate the second Y() thus terminating > the whole call chain of the second Y(). > > The only reason that Y() ever terminates is that X() stops simulating it > at some point. > Y -> X -> Y X terminates 2nd Y, and thus first Y terminates on its own. THus Y is finite. You conflate the realms of execution,
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-20 08:04 -0400 |
| Message-ID | <WqzfI.4709$XW6.3779@fx11.iad> |
| In reply to | #31546 |
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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-20 10:33 -0500 |
| Message-ID | <f_ydnebkouuyaeP9nZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #31569 |
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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 1 of 4 [1] 2 3 4 Next page →
Back to top | Article view | comp.theory
csiph-web