Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #31240 > unrolled thread
| Started by | olcott <NoOne@nospicedham.NoWhere.com> |
|---|---|
| First post | 2021-04-17 09:15 -0500 |
| Last post | 2021-04-18 15:47 -0400 |
| Articles | 20 on this page of 145 — 12 participants |
Back to article view | Back to comp.theory
Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@nospicedham.NoWhere.com> - 2021-04-17 09:15 -0500
Re: Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@nospicedham.NoWhere.com> - 2021-04-17 11:01 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 14:02 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 14:23 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-18 01:57 +0000
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 21:03 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-18 02:17 +0000
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 21:21 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-17 19:27 -0700
Re: Infinite recursion detection criteria (Please correct me if I am wrong) Richard Damon <Richard@Damon-Family.org> - 2021-04-17 23:50 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) olcott <NoOne@NoWhere.com> - 2021-04-17 22:59 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 07:52 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) olcott <NoOne@NoWhere.com> - 2021-04-18 10:08 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:42 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) olcott <NoOne@NoWhere.com> - 2021-04-18 15:29 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2021-04-18 13:57 -0700
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 17:55 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) olcott <NoOne@NoWhere.com> - 2021-04-18 17:03 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 18:14 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong)(revised) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 00:35 +0100
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-18 18:42 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 01:13 +0100
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-18 19:47 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 02:25 +0100
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-18 20:40 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 03:00 +0100
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-18 21:11 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-19 23:44 +0100
Re: Infinite recursion detection criteria: X() simulates Y() olcott <polcott2@gmail.com> - 2021-04-19 21:02 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 03:53 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-19 21:57 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 04:21 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-19 22:35 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-04-19 22:09 -0700
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 00:13 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) "dklei...@gmail.com" <dkleinecke@gmail.com> - 2021-04-20 12:34 -0700
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 12:00 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 10:34 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 19:27 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 14:22 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2021-04-20 13:31 -0700
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 15:57 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-20 23:03 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 17:17 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 02:15 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 21:50 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 04:15 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-20 22:20 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 15:05 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-21 09:35 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 11:03 -0400
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-21 23:32 +0100
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-21 17:39 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 01:37 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-21 19:42 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 02:46 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-21 21:22 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-22 13:15 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 09:33 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 00:41 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 18:47 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 01:12 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 19:15 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 02:05 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 20:12 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 02:37 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 20:44 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 01:27 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 19:53 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 02:34 +0100
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-23 21:00 -0500
Re: Infinite recursion detection criteria: (formalized) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 22:24 -0400
Re: Infinite recursion detection criteria: (formalized) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 03:45 +0100
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-23 22:00 -0500
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-23 22:02 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 23:57 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 23:42 +0100
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-24 21:16 -0500
Re: Infinite recursion detection criteria: (formalized) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-25 14:06 +0100
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-25 09:15 -0500
Re: Infinite recursion detection criteria: (formalized) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 12:52 -0400
Re: Infinite recursion detection criteria: (formalized) olcott <NoOne@NoWhere.com> - 2021-04-25 13:12 -0500
Re: Infinite recursion detection criteria: (formalized) Richard Damon <Richard@Damon-Family.org> - 2021-04-25 19:53 -0400
Re: Infinite recursion detection criteria: (formalized) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-26 01:48 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 02:42 +0100
Re: Infinite recursion detection criteria: (Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-04-23 20:20 -0500
Re: Infinite recursion detection criteria: (Ben contradicts himself) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 03:40 +0100
Re: Infinite recursion detection criteria: (Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-04-23 22:11 -0500
Re: Infinite recursion detection criteria: (Ben contradicts himself) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-25 00:22 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 20:24 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-23 02:56 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 21:10 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 22:45 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 22:19 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 07:43 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 09:19 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 11:19 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 10:48 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 12:22 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 11:37 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 13:42 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-23 04:56 +0000
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <polcott2@gmail.com> - 2021-04-23 00:04 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-23 07:43 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 01:35 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 20:13 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 02:53 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 21:03 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 03:49 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-23 22:16 -0500
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-24 23:02 +0100
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) Richard Damon <Richard@Damon-Family.org> - 2021-04-22 22:14 -0400
Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) olcott <NoOne@NoWhere.com> - 2021-04-22 21:44 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 07:59 -0400
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-21 09:11 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Richard Damon <Richard@Damon-Family.org> - 2021-04-21 11:16 -0400
Re: Infinite recursion detection criteria: X() simulates Y() Richard Damon <Richard@Damon-Family.org> - 2021-04-18 22:23 -0400
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-18 21:25 -0500
Re: Infinite recursion detection criteria: X() simulates Y() Richard Damon <Richard@Damon-Family.org> - 2021-04-19 07:26 -0400
Re: Infinite recursion detection criteria: X() simulates Y() olcott <NoOne@NoWhere.com> - 2021-04-19 10:16 -0500
Re: Infinite recursion detection criteria: (erroneous conflation) olcott <NoOne@NoWhere.com> - 2021-04-19 10:26 -0500
Re: Infinite recursion detection criteria: (erroneous conflation) Richard Damon <Richard@Damon-Family.org> - 2021-04-19 12:03 -0400
Re: Infinite recursion detection criteria: (erroneous conflation) Jeff Barnett <jbb@notatt.com> - 2021-04-19 14:38 -0600
Re: Infinite recursion detection criteria: X() simulates Y() Richard Damon <Richard@Damon-Family.org> - 2021-04-19 22:32 -0400
Re: Infinite recursion detection criteria: (equivalent definitions) olcott <NoOne@NoWhere.com> - 2021-04-19 21:53 -0500
Re: Infinite recursion detection criteria: (equivalent definitions) Richard Damon <Richard@Damon-Family.org> - 2021-04-20 08:03 -0400
Re: Infinite recursion detection criteria (Please correct me if I am Kaz Kylheku <563-365-8930@nospicedham.kylheku.com> - 2021-04-17 15:01 +0000
Re: Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@NoWhere.com> - 2021-04-17 17:30 -0500
Re: Infinite recursion detection criteria (Please correct me if I am Kaz Kylheku <563-365-8930@kylheku.com> - 2021-04-18 01:58 +0000
Re: Infinite recursion detection criteria (Please correct me if I am R Kym Horsell <kym@kymhorsell.com> - 2021-04-18 00:06 +0000
Re: Infinite recursion detection criteria (Please correct me if I am Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 02:16 +0100
Re: Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@NoWhere.com> - 2021-04-17 20:30 -0500
Re: Infinite recursion detection criteria (Please correct me if I am Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 02:33 +0100
Re: Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@NoWhere.com> - 2021-04-17 20:42 -0500
Re: Infinite recursion detection criteria (Please correct me if I am Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 21:58 +0100
Re: Infinite recursion detection criteria (Please correct me if I am Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-04-18 01:35 +0100
Re: Infinite recursion detection criteria (Please correct me if I am olcott <NoOne@NoWhere.com> - 2021-04-17 19:38 -0500
Re: Infinite recursion detection criteria (Please correct me if I am Richard Damon <Richard@Damon-Family.org> - 2021-04-17 22:46 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 21:54 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 00:00 -0400
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 23:02 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) olcott <NoOne@NoWhere.com> - 2021-04-17 23:08 -0500
Re: Infinite recursion detection criteria (Please correct me if I am wrong) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 07:55 -0400
Re: Infinite recursion detection criteria (universal halt decider) olcott <NoOne@NoWhere.com> - 2021-04-18 10:20 -0500
Re: Infinite recursion detection criteria (universal halt decider) Richard Damon <Richard@Damon-Family.org> - 2021-04-18 15:47 -0400
Page 7 of 8 — ← Prev page 1 2 3 4 5 6 [7] 8 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 10:26 -0500 |
| Subject | Re: Infinite recursion detection criteria: (erroneous conflation) |
| Message-ID | <s6udnasaac-VPOD9nZ2dnUU7-XPNnZ2d@giganews.com> |
| In reply to | #31449 |
On 4/19/2021 10:16 AM, olcott wrote: > On 4/19/2021 6:26 AM, Richard Damon wrote: >> On 4/18/21 10:25 PM, olcott wrote: >>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>> >>>> >>>> So, this does not apply to the Halting Problem of Computation Theory. >>>> >>>> You left the game as soon as you redefined core terms. >>>> >>>> THAT is LOGIC 101. >>>> >>> >>> To someone that only learns by rote it may seem this way. >>> >> >> >> OK, so you are leaving the WHOLE world of logic. I guess that makes >> sense for you. > > > Not at all. It is merely that your understanding of logic it only > learned by rote so any new idea that is derived by correctly applying > established ideas is deemed to be incorrect on the basis of this new > idea was not already written down in the textbooks that you learned by > rote. > > The way that you are examining the problem does not answer the question Does the input halt on its input? Your answer to the question is based on: Does the input conflated together with the halt decider halt on its input? When we stop conflating the execution of the halt decider with the execution of the input and only examine the execution of the input ignoring the execution of the halt decider then the input does not halt on its input is true. -- 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-19 12:03 -0400 |
| Subject | Re: Infinite recursion detection criteria: (erroneous conflation) |
| Message-ID | <fRhfI.32435$2A5.29413@fx45.iad> |
| In reply to | #31450 |
On 4/19/21 11:26 AM, olcott wrote: > On 4/19/2021 10:16 AM, olcott wrote: >> On 4/19/2021 6:26 AM, Richard Damon wrote: >>> On 4/18/21 10:25 PM, olcott wrote: >>>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>>> >>>>> >>>>> So, this does not apply to the Halting Problem of Computation Theory. >>>>> >>>>> You left the game as soon as you redefined core terms. >>>>> >>>>> THAT is LOGIC 101. >>>>> >>>> >>>> To someone that only learns by rote it may seem this way. >>>> >>> >>> >>> OK, so you are leaving the WHOLE world of logic. I guess that makes >>> sense for you. >> >> >> Not at all. It is merely that your understanding of logic it only >> learned by rote so any new idea that is derived by correctly applying >> established ideas is deemed to be incorrect on the basis of this new >> idea was not already written down in the textbooks that you learned by >> rote. >> >> > > The way that you are examining the problem does not answer the question > Does the input halt on its input? > > Your answer to the question is based on: Does the input conflated > together with the halt decider halt on its input? > > When we stop conflating the execution of the halt decider with the > execution of the input and only examine the execution of the input > ignoring the execution of the halt decider then the input does not halt > on its input is true. > > In Linz and such there is NOT a conflated input. You need to follow the right steps to get the answer. First, you need to define FULLY the algorithm that the Halt Decider will use. At this point there can be no conflated input, as by the definition of a Universal Halt Decider, it is to handle all inputs. Note, that being a Computation, the exact steps and their sequence are fixed. The code for this decider, when used as THIS decider is fixed for the proof. Second, we define H^ based on a defined procedure, creating a modified version of the Halt decider. Note, this is a seperate and complete machine in its own right, and again, its code if fixed for the proof. H^ HAS no recursion of self-reference in its structure. It merely passes its input, with a duplication as H^ takes as input a program description and H takes a program description and an input description, to the algorithm of the Halt Decider defined above. Once all the code is firmly fixed, and we can not touch it, we take that code base, and form a description of it according to the rules defined by that halt decider. This is a well defined operation. When we do this, we include the full coding of H^, including a coding of H in the input. We then apply this simply defined input to the fully defined machine. Note, this is NOT recursive, any more than asking a C compiler to compile the code for itself is 'recursive'. The machine isn't working on a definition that the input IS this copy (and that may be part of your error, you are modifying the machine to assume that), the input just happens to be a copy. Note, when we formed this input, we could have used ANY of the multitude of possible ways to encode the machine H^ (which includes the code for H), YOUR structure, where you replace all these independent copies with reference to a single piece of code is waht conflates together the halt decider and its input. The original problem statement has no such issue.
[toc] | [prev] | [next] | [standalone]
| From | Jeff Barnett <jbb@notatt.com> |
|---|---|
| Date | 2021-04-19 14:38 -0600 |
| Subject | Re: Infinite recursion detection criteria: (erroneous conflation) |
| Message-ID | <s5kpo7$lo8$1@dont-email.me> |
| In reply to | #31450 |
On 4/19/2021 9:26 AM, olcott wrote: > On 4/19/2021 10:16 AM, olcott wrote: >> On 4/19/2021 6:26 AM, Richard Damon wrote: >>> On 4/18/21 10:25 PM, olcott wrote: >>>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>>> >>>>> >>>>> So, this does not apply to the Halting Problem of Computation Theory. >>>>> >>>>> You left the game as soon as you redefined core terms. >>>>> >>>>> THAT is LOGIC 101. >>>>> >>>> >>>> To someone that only learns by rote it may seem this way. >>>> >>> >>> >>> OK, so you are leaving the WHOLE world of logic. I guess that makes >>> sense for you. >> >> >> Not at all. It is merely that your understanding of logic it only >> learned by rote so any new idea that is derived by correctly applying >> established ideas is deemed to be incorrect on the basis of this new >> idea was not already written down in the textbooks that you learned by >> rote. >> >> > > The way that you are examining the problem does not answer the question > Does the input halt on its input? > > Your answer to the question is based on: Does the input conflated > together with the halt decider halt on its input? > > When we stop conflating the execution of the halt decider with the > execution of the input and only examine the execution of the input > ignoring the execution of the halt decider then the input does not halt > on its input is true. The village idiot at work again. N.B. You are responding to and arguing with your self once more! I think the idea that you don't read what you respond to is on point. You'll argue with anything. I know these threads relieve the tedium and boredom of your life. Can't hold a job; can't make friends; don't have the attention span to learn interesting stuff; etc. Arguing with your self and not profiting by it points at a padded room for you. We'd be happy to assist you in making the arrangements. If you need help, I'm sure Ben and others would be there for you. -- Jeff Barnett
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-19 22:32 -0400 |
| Subject | Re: Infinite recursion detection criteria: X() simulates Y() |
| Message-ID | <g3rfI.2338$od.991@fx15.iad> |
| In reply to | #31449 |
On 4/19/21 11:16 AM, olcott wrote: > On 4/19/2021 6:26 AM, Richard Damon wrote: >> On 4/18/21 10:25 PM, olcott wrote: >>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>> >>>> >>>> So, this does not apply to the Halting Problem of Computation Theory. >>>> >>>> You left the game as soon as you redefined core terms. >>>> >>>> THAT is LOGIC 101. >>>> >>> >>> To someone that only learns by rote it may seem this way. >>> >> >> >> OK, so you are leaving the WHOLE world of logic. I guess that makes >> sense for you. > > > Not at all. It is merely that your understanding of logic it only > learned by rote so any new idea that is derived by correctly applying > established ideas is deemed to be incorrect on the basis of this new > idea was not already written down in the textbooks that you learned by > rote. > > Wrong. It is YOUR lack of real knowledge about logic that makes you think you don't need to follow the rules. You can not prove or disprove a given theorem without using the exact same definitions that the provided theorem is based on. Yes, you can alter the definitions and prove or disprove a RELATED theorem based on your new definition, but that is a DIFFERENT theorem.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 21:53 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions) |
| Message-ID | <04idnWndS6qo3-P9nZ2dnUU7-VXNnZ2d@giganews.com> |
| In reply to | #31526 |
On 4/19/2021 9:32 PM, Richard Damon wrote: > On 4/19/21 11:16 AM, olcott wrote: >> On 4/19/2021 6:26 AM, Richard Damon wrote: >>> On 4/18/21 10:25 PM, olcott wrote: >>>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>>> >>>>> >>>>> So, this does not apply to the Halting Problem of Computation Theory. >>>>> >>>>> You left the game as soon as you redefined core terms. >>>>> >>>>> THAT is LOGIC 101. >>>>> >>>> >>>> To someone that only learns by rote it may seem this way. >>>> >>> >>> >>> OK, so you are leaving the WHOLE world of logic. I guess that makes >>> sense for you. >> >> >> Not at all. It is merely that your understanding of logic it only >> learned by rote so any new idea that is derived by correctly applying >> established ideas is deemed to be incorrect on the basis of this new >> idea was not already written down in the textbooks that you learned by >> rote. >> >> > > Wrong. It is YOUR lack of real knowledge about logic that makes you > think you don't need to follow the rules. > > You can not prove or disprove a given theorem without using the exact > same definitions that the provided theorem is based on. > > Yes, you can alter the definitions and prove or disprove a RELATED > theorem based on your new definition, but that is a DIFFERENT theorem. I can transform one definition into another equivalent definition. 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. Every input having infinite execution would have to have its simulation aborted to prevent its otherwise infinite execution. 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 08:03 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions) |
| Message-ID | <VpzfI.4708$XW6.1446@fx11.iad> |
| In reply to | #31533 |
On 4/19/21 10:53 PM, olcott wrote: > On 4/19/2021 9:32 PM, Richard Damon wrote: >> On 4/19/21 11:16 AM, olcott wrote: >>> On 4/19/2021 6:26 AM, Richard Damon wrote: >>>> On 4/18/21 10:25 PM, olcott wrote: >>>>> On 4/18/2021 9:23 PM, Richard Damon wrote: >>>>>>> >>>>>> >>>>>> So, this does not apply to the Halting Problem of Computation Theory. >>>>>> >>>>>> You left the game as soon as you redefined core terms. >>>>>> >>>>>> THAT is LOGIC 101. >>>>>> >>>>> >>>>> To someone that only learns by rote it may seem this way. >>>>> >>>> >>>> >>>> OK, so you are leaving the WHOLE world of logic. I guess that makes >>>> sense for you. >>> >>> >>> Not at all. It is merely that your understanding of logic it only >>> learned by rote so any new idea that is derived by correctly applying >>> established ideas is deemed to be incorrect on the basis of this new >>> idea was not already written down in the textbooks that you learned by >>> rote. >>> >>> >> >> Wrong. It is YOUR lack of real knowledge about logic that makes you >> think you don't need to follow the rules. >> >> You can not prove or disprove a given theorem without using the exact >> same definitions that the provided theorem is based on. >> >> Yes, you can alter the definitions and prove or disprove a RELATED >> theorem based on your new definition, but that is a DIFFERENT theorem. > > I can transform one definition into another equivalent definition. > > 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. > > Every input having infinite execution would have to have its simulation > aborted to prevent its otherwise infinite execution. > > 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 the test for equivalence is that the sets are identical. The issue is that you use a changing definition (or wrong proof) of have to have. H_Hat does halt. That means by your definitions above, that H_Hat did not need to have its simulation aborted. The fact that you can claim to prove otherwise means either your definitions changed, your proof is invalid, or your logic system is inconsistent. You need to look at reality, and not just the ravings in your mind.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@nospicedham.kylheku.com> |
|---|---|
| Date | 2021-04-17 15:01 +0000 |
| Message-ID | <20210417074758.258@kylheku.com> |
| In reply to | #31240 |
On 2021-04-17, olcott <NoOne@nospicedham.NoWhere.com> wrote: > If a function X() is called by function Y() twice in sequence from the > same machine address of Y() with the same parameters to X() and the > execution trace shows no conditional branch instructions in Y() or The problem is, the execution trace only shows no such instructions because you have concealed them. You have declared that X is part of the "operating system" and not part of the test case. So in your trace there is an illegal discontinuity. There is a JSR Halts instruction executed, but then the next instruction which is traced is not inside Halts, but inside H_Hat. The address does not match. > function call returns in X() then the function call from Y() to X() is > infinitely recursive unless X() stops it. Problem is, the above decision about the traces is being made by X itself. It is accessing these global tracers, which make X not a function, but an imperative procedure. Below is a quote from the following idiotic document: http://www.liarparadox.org/Eliminating_pathological_self_reference_error_from_the_halting_problem.pdf Note how after every "call 00000833", the next instruction being traced is not 00000833, but 00000A63. A63 is _H_Hat. The document does not reveal the disassembly of code at 833, so we have no idea what instructions are there. However, those instructions have to do with the decision that leads to "Infinite Recursion Detected", which is not possible without conditionals. (01)[00000a93][000114f7][00000000] (01) 55 push ebp (02)[00000a94][000114f7][00000000] (02) 8bec mov ebp,esp (03)[00000a96][000114f3][00000000] (01) 51 push ecx (04)[00000a97][000114ef][00000a63] (05) 68630a0000 push 00000a63 (05)[00000a9c][000114eb][00000a63] (05) 68630a0000 push 00000a63 (06)[00000aa1][000114e7][00000aa6] (05) e8ddfdffff call 00000883 (07)[00000a63][00031577][0003157b] (01) 55 push ebp (08)[00000a64][00031577][0003157b] (02) 8bec mov ebp,esp (09)[00000a66][00031573][00021547] (01) 51 push ecx (10)[00000a67][00031573][00021547] (03) 8b4508 mov eax,[ebp+08] (11)[00000a6a][0003156f][00000a63] (01) 50 push eax (12)[00000a6b][0003156f][00000a63] (03) 8b4d08 mov ecx,[ebp+08] (13)[00000a6e][0003156b][00000a63] (01) 51 push ecx (14)[00000a6f][00031567][00000a74] (05) e80ffeffff call 00000883 (15)[00000a63][0004271f][00042723] (01) 55 push ebp (16)[00000a64][0004271f][00042723] (02) 8bec mov ebp,esp (17)[00000a66][0004271b][000326ef] (01) 51 push ecx (18)[00000a67][0004271b][000326ef] (03) 8b4508 mov eax,[ebp+08] (19)[00000a6a][00042717][00000a63] (01) 50 push eax (20)[00000a6b][00042717][00000a63] (03) 8b4d08 mov ecx,[ebp+08] (21)[00000a6e][00042713][00000a63] (01) 51 push ecx (22)[00000a6f][0004270f][00000a74] (05) e80ffeffff call 00000883 Infinite Recursion Detected Simulation Stopped -- 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-17 17:30 -0500 |
| Message-ID | <io6dnc21a4QY_Ob9nZ2dnUU7-fmdnZ2d@giganews.com> |
| In reply to | #31276 |
On 4/17/2021 10:01 AM, Kaz Kylheku wrote: > On 2021-04-17, olcott <NoOne@nospicedham.NoWhere.com> wrote: >> If a function X() is called by function Y() twice in sequence from the >> same machine address of Y() with the same parameters to X() and the >> execution trace shows no conditional branch instructions in Y() or > > The problem is, the execution trace only shows no such instructions > because you have concealed them. You are responding with boiler-plate that does not account for my reconfiguration. A halt deciding principle that detects infinite recursion If a function X() is called by function Y() twice in sequence from the same machine address of Y() with the same parameters to X() and the execution trace shows no conditional branch instructions in Y() or a function call returns from X() then the function call from Y() to X() is infinitely recursive unless X() stops it. The above specification need not look inside X() at all as long is we have the assurance that the execution trace of X() does not include any "ret" instructions. I modified my halt decider to makes sure that this part works correctly. -- 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-18 01:58 +0000 |
| Message-ID | <20210417185712.138@kylheku.com> |
| In reply to | #31277 |
On 2021-04-17, olcott <NoOne@NoWhere.com> wrote: > On 4/17/2021 10:01 AM, Kaz Kylheku wrote: >> On 2021-04-17, olcott <NoOne@nospicedham.NoWhere.com> wrote: >>> If a function X() is called by function Y() twice in sequence from the >>> same machine address of Y() with the same parameters to X() and the >>> execution trace shows no conditional branch instructions in Y() or >> >> The problem is, the execution trace only shows no such instructions >> because you have concealed them. > You are responding with boiler-plate that does not account for my > reconfiguration. > > A halt deciding principle that detects infinite recursion > If a function X() is called by function Y() twice in sequence from the > same machine address of Y() with the same parameters to X() and the > execution trace shows no conditional branch instructions in Y() or a > function call returns from X() then the function call from Y() to X() is > infinitely recursive unless X() stops it. Correction: "execution trace shows no conditional branch instructions anywhere; not in Y, not in X" continue ...
[toc] | [prev] | [next] | [standalone]
| From | R Kym Horsell <kym@kymhorsell.com> |
|---|---|
| Date | 2021-04-18 00:06 +0000 |
| Message-ID | <s5ft59$1p08$2@gioia.aioe.org> |
| In reply to | #31240 |
In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: > If a function X() is called by function Y() twice in sequence from the > same machine address of Y() with the same parameters to X() and the Dont forget "all the memory is the same". In the case of a TM that's a bit of countable testing. > execution trace shows no conditional branch instructions in Y() or > function call returns in X() then the function call from Y() to X() is > infinitely recursive unless X() stops it. > The referenced excution trace is on x86 machine language, disassembled > for human consumption. Blary blaghdy blahdee.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-18 02:16 +0100 |
| Message-ID | <877dl08k96.fsf@bsb.me.uk> |
| In reply to | #31278 |
R Kym Horsell <kym@kymhorsell.com> writes: > In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: >> If a function X() is called by function Y() twice in sequence from the >> same machine address of Y() with the same parameters to X() and the > > Dont forget "all the memory is the same". In the case of > a TM that's a bit of countable testing. In PO's "an x86 is a TM" world, that's not possible since a function call alters the machine's state (stack and stack pointer at the least one would imagine). -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-17 20:30 -0500 |
| Message-ID | <kvqdnQMdt445Fub9nZ2dnUU7-eednZ2d@giganews.com> |
| In reply to | #31288 |
On 4/17/2021 8:16 PM, Ben Bacarisse wrote: > R Kym Horsell <kym@kymhorsell.com> writes: > >> In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: >>> If a function X() is called by function Y() twice in sequence from the >>> same machine address of Y() with the same parameters to X() and the >> >> Dont forget "all the memory is the same". In the case of >> a TM that's a bit of countable testing. > > In PO's "an x86 is a TM" world, that's not possible since a function > call alters the machine's state (stack and stack pointer at the least > one would imagine). > I create virtual machines that execute in their own process context. -- 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-18 02:33 +0100 |
| Message-ID | <871rb88jgj.fsf@bsb.me.uk> |
| In reply to | #31290 |
olcott <NoOne@NoWhere.com> writes: > On 4/17/2021 8:16 PM, Ben Bacarisse wrote: >> R Kym Horsell <kym@kymhorsell.com> writes: >> >>> In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: >>>> If a function X() is called by function Y() twice in sequence from the >>>> same machine address of Y() with the same parameters to X() and the >>> >>> Dont forget "all the memory is the same". In the case of >>> a TM that's a bit of countable testing. >> >> In PO's "an x86 is a TM" world, that's not possible since a function >> call alters the machine's state (stack and stack pointer at the least >> one would imagine). > > I create virtual machines that execute in their own process context. If you didn't understand what I said, you could always ask for more information. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-17 20:42 -0500 |
| Message-ID | <v-WdnSonevn0E-b9nZ2dnUU7-XWdnZ2d@giganews.com> |
| In reply to | #31291 |
On 4/17/2021 8:33 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/17/2021 8:16 PM, Ben Bacarisse wrote: >>> R Kym Horsell <kym@kymhorsell.com> writes: >>> >>>> In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: >>>>> If a function X() is called by function Y() twice in sequence from the >>>>> same machine address of Y() with the same parameters to X() and the >>>> >>>> Dont forget "all the memory is the same". In the case of >>>> a TM that's a bit of countable testing. >>> >>> In PO's "an x86 is a TM" world, that's not possible since a function >>> call alters the machine's state (stack and stack pointer at the least >>> one would imagine). >> >> I create virtual machines that execute in their own process context. > > If you didn't understand what I said, you could always ask for more > information. > Yeah right and if I spoke to you in ancient Hebrew I could offer to teach you Hebrew. It my system does not work in x64 then I don't use x64. -- 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-18 21:58 +0100 |
| Message-ID | <87fszn5mym.fsf@bsb.me.uk> |
| In reply to | #31293 |
olcott <NoOne@NoWhere.com> writes: > On 4/17/2021 8:33 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/17/2021 8:16 PM, Ben Bacarisse wrote: >>>> R Kym Horsell <kym@kymhorsell.com> writes: >>>> >>>>> In comp.theory Moplessly Confused olcott <NoOne@nospicedham.nowhere.com> wrote: >>>>>> If a function X() is called by function Y() twice in sequence from the >>>>>> same machine address of Y() with the same parameters to X() and the >>>>> >>>>> Dont forget "all the memory is the same". In the case of >>>>> a TM that's a bit of countable testing. >>>> >>>> In PO's "an x86 is a TM" world, that's not possible since a function >>>> call alters the machine's state (stack and stack pointer at the least >>>> one would imagine). >>> >>> I create virtual machines that execute in their own process context. >> >> If you didn't understand what I said, you could always ask for more >> information. >> > > Yeah right and if I spoke to you in ancient Hebrew I could offer to > teach you Hebrew. It my system does not work in x64 then I don't use > x64. You are cutting and pasting. Nothing you have said relates to my remark. I was harsh to suggest you didn't understand it. I think you didn't read it. You just guess what I am probably posting about a cut and paste a stock reply to keep people talking to you. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-18 01:35 +0100 |
| Message-ID | <87sg3o8m5l.fsf@bsb.me.uk> |
| In reply to | #31240 |
olcott <NoOne@nospicedham.NoWhere.com> writes: > If a function X() is called by function Y() twice in sequence from the > same machine address of Y() with the same parameters to X() and the > execution trace shows no conditional branch instructions in Y() or > function call returns in X() then the function call from Y() to X() is > infinitely recursive unless X() stops it. I posted a trace to the other post on the same topic. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-17 19:38 -0500 |
| Message-ID | <tLKdnS30L97n4ub9nZ2dnUU7-d-dnZ2d@giganews.com> |
| In reply to | #31282 |
On 4/17/2021 7:35 PM, Ben Bacarisse wrote: > olcott <NoOne@nospicedham.NoWhere.com> writes: > >> If a function X() is called by function Y() twice in sequence from the >> same machine address of Y() with the same parameters to X() and the >> execution trace shows no conditional branch instructions in Y() or >> function call returns in X() then the function call from Y() to X() is >> infinitely recursive unless X() stops it. > > I posted a trace to the other post on the same topic. > I couldn't make that out it is not the syntax that I am familiar with does it get past this newly updated criteria? If the execution trace of function X() called by function Y() shows: (1) Function X() is called twice in sequence from the same machine address of Y(). (2) With the same parameters to X(). (3) With no conditional branch or indexed jump instructions in Y(). (4) With no function call returns from X(). then the function call from Y() to X() is infinitely recursive unless X() stops it. -- 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-17 22:46 -0400 |
| Message-ID | <G4NeI.47894$nn2.39692@fx48.iad> |
| In reply to | #31240 |
On 4/17/21 10:15 AM, olcott wrote: > If a function X() is called by function Y() twice in sequence from the > same machine address of Y() with the same parameters to X() and the > execution trace shows no conditional branch instructions in Y() or > function call returns in X() then the function call from Y() to X() is > infinitely recursive unless X() stops it. > > The referenced excution trace is on x86 machine language, disassembled > for human consumption. > The issue is that if the second or later calls to X are involved in the termination of Y, and that termination is part of the definition of X that Y is allowed to depend on, then it is NOT correct that Y is infinitely recursive, as the conditionals in the X that is calls is part of its operation. Function Y is allowed to depend on the proper operation of the functions it calls, and conditions in them need to be considered as part of its logic. For the Halting Problem which this is in reference to, in order of halt decider X to accurately predict the halting/non-halting behavior or Y, it needs to consider that if the second level invocation of X terminates the second level invocation of Y and returns a result, and that affect the behavior of the first level of Y, that is all part of the computation that is Y.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-17 21:54 -0500 |
| Subject | Re: Infinite recursion detection criteria (Please correct me if I am wrong) |
| Message-ID | <VLmdnd7RjsD0Aub9nZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #31313 |
On 4/17/2021 9:46 PM, Richard Damon wrote: > On 4/17/21 10:15 AM, olcott wrote: >> If a function X() is called by function Y() twice in sequence from the >> same machine address of Y() with the same parameters to X() and the >> execution trace shows no conditional branch instructions in Y() or >> function call returns in X() then the function call from Y() to X() is >> infinitely recursive unless X() stops it. >> >> The referenced excution trace is on x86 machine language, disassembled >> for human consumption. >> > > The issue is that if the second or later calls to X are involved in the > termination of Y, and that termination is part of the definition of X > that Y is allowed to depend on, then it is NOT correct that Y is > infinitely recursive, as the conditionals in the X that is calls is part > of its operation. None-the-less this does provide X() with the correct criteria to terminate what would otherwise be the infinite recursion of Y(): If the execution trace of function X() called by function Y() shows: (1) Function X() is called twice in sequence from the same machine address of Y(). (2) With the same parameters to X(). (3) With no conditional branch or indexed jump instructions in Y(). (4) With no function call returns from X(). then the function call from Y() to X() is infinitely recursive unless X() stops it. -- 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-18 00:00 -0400 |
| Subject | Re: Infinite recursion detection criteria (Please correct me if I am wrong) |
| Message-ID | <79OeI.47898$nn2.11054@fx48.iad> |
| In reply to | #31314 |
On 4/17/21 10:54 PM, olcott wrote: > On 4/17/2021 9:46 PM, Richard Damon wrote: >> On 4/17/21 10:15 AM, olcott wrote: >>> If a function X() is called by function Y() twice in sequence from the >>> same machine address of Y() with the same parameters to X() and the >>> execution trace shows no conditional branch instructions in Y() or >>> function call returns in X() then the function call from Y() to X() is >>> infinitely recursive unless X() stops it. >>> >>> The referenced excution trace is on x86 machine language, disassembled >>> for human consumption. >>> >> >> The issue is that if the second or later calls to X are involved in the >> termination of Y, and that termination is part of the definition of X >> that Y is allowed to depend on, then it is NOT correct that Y is >> infinitely recursive, as the conditionals in the X that is calls is part >> of its operation. > > > None-the-less this does provide X() with the correct criteria to > terminate what would otherwise be the infinite recursion of Y(): > > If the execution trace of function X() called by function Y() shows: > (1) Function X() is called twice in sequence from the same machine > address of Y(). > (2) With the same parameters to X(). > (3) With no conditional branch or indexed jump instructions in Y(). > (4) With no function call returns from X(). > then the function call from Y() to X() is infinitely recursive unless > X() stops it. > The issue is that your 'unconventional' definition of infinite recursion has lost the power to detect non-halting, because if the second layer call to X breaks the operation, and returns to Y, the recursion is broken. Once you move your argument from actual phyical calls to simulation, so the first X is deciding after some execution has taken place, then if the first X decides to abort the execution, it is also true that the if allowed to continue, the second one would abort too, and thus even though you haven't see a return YET, there would have been one if the first invocation acted differently. Since in the actual test, when we just run Y as the top level function (removing the outer deciding X) the second (now first) X WILL do its abort and thus Y will halt. This is why your criteria is wrong. It doesn't correctly model that actual behavior of the machine when run by itself.
[toc] | [prev] | [next] | [standalone]
Page 7 of 8 — ← Prev page 1 2 3 4 5 6 [7] 8 Next page →
Back to top | Article view | comp.theory
csiph-web