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 6 of 8 — ← Prev page 1 2 3 4 5 [6] 7 8 Next page →
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-23 13:42 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <1GDgI.23606$RC2.3794@fx27.iad> |
| In reply to | #32005 |
On 4/23/21 12:37 PM, olcott wrote: > On 4/23/2021 11:22 AM, Richard Damon wrote: >> On 4/23/21 11:48 AM, olcott wrote: >>> On 4/23/2021 10:19 AM, Richard Damon wrote: >>>> On 4/23/21 10:19 AM, olcott wrote: >>>>> On 4/23/2021 6:43 AM, Richard Damon wrote: >>>>>> On 4/22/21 11:19 PM, olcott wrote: >>>>>>> On 4/22/2021 9:45 PM, Richard Damon wrote: >>>>>>>> On 4/22/21 10:10 PM, olcott wrote: >>>>>>>>> On 4/22/2021 8:56 PM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 4/22/2021 6:41 PM, Ben Bacarisse wrote: >>>>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>>>>> We assume the existence of a certain Turing machine F. This >>>>>>>>>>>>> machine >>>>>>>>>>>>> has several properties. >>>>>>>>>>>>> (a) The parameters to F are a Turing machine description and a >>>>>>>>>>>>> finite >>>>>>>>>>>>> string. >>>>>>>>>> ... >>>>>>>>>>>>> (b) F simulates its input pair one state transition at a time. >>>>>>>>>>>>> (c) F maintains an execution trace list of all of the >>>>>>>>>>>>> details of >>>>>>>>>>>>> each >>>>>>>>>>>>> state transition of the simulation of its input pair. >>>>>>>>>> ... >>>>>>>>>>>>> (d) After the simulation of each state transition of its input >>>>>>>>>>>>> pair H >>>>>>>>>>>>> consults this execution trace. >>>>>>>>>>>>> (e) F can infallibly detect that an input pair specifies >>>>>>>>>>>>> infinite >>>>>>>>>>>>> execution as some point in its simulation of its input pair. >>>>>>>>>>>> >>>>>>>>>>>> Whoop! whoop! whoop! Assumed without evidence. >>>>>>>>>>> >>>>>>>>>>> That is an assumed premise. >>>>>>>>>> >>>>>>>>>> You are right. All of (a) to (g) are part of the initial premise >>>>>>>>>> that >>>>>>>>>> such a machine exists. >>>>>>>>>> >>>>>>>>>> Do you believe that such a TM exists? This looks for all the >>>>>>>>>> world >>>>>>>>>> like >>>>>>>>>> the code sketch you've been discussing (but described as a >>>>>>>>>> TM). It >>>>>>>>>> seems odd to describe such a TM if you know it is impossible. >>>>>>>>>> >>>>>>>>>> By the way, it's fine to say you don't know. You should know, >>>>>>>>>> but >>>>>>>>>> you may in fact not know. >>>>>>>>>> >>>>>>>>> >>>>>>>>> I am only dealing with the H_Hat type of configuration. >>>>>>>>> >>>>>>>>>>>>> (g) At the point where F infallibly detects the infinite >>>>>>>>>>>>> execution of >>>>>>>>>>>>> its input pair F decides to stop simulating its input. >>>>>>>>>>> >>>>>>>>>>> Every finite string that has the property of infinite execution >>>>>>>>>>> seems >>>>>>>>>>> to contradict this property when it is forced to halt. >>>>>>>>>> >>>>>>>>>> Does this mean you don't believe that such an F exists? Note >>>>>>>>>> that >>>>>>>>>> you've made a similar claim before: >>>>>>>>>> >>>>>>>>> >>>>>>>>> I know that My Halts() does correctly decide its H_Hat(). >>>>>>>> >>>>>>>> Maybe you 'know' it, but you are wrong, either that or Halts() >>>>>>>> doesn't >>>>>>>> meet the requirements to be a Decider by Computation Theory, or >>>>>>>> H_Hat >>>>>>>> isn't built by the pattern of Linz or Sipser. >>>>>>>> >>>>>>> >>>>>>> You are wrong on both these points. >>>>>>> >>>>>> >>>>>> WRONG. Find the error: >>>>>> >>>>>> 1) Halts is stipulated to meet the requirements of a Halt Decider. >>>>>> >>>>>> 2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) >>>>>> when >>>>>> asked direction >>>>>> >>> >>> So a halt decide is only correct when it asks you whether or not it >>> should make a left hand turn? (asked direction) >> >> So you disagree that Halts returns non-halting? >> >>> >>>>>> 3) H_Hat is stipulated to be built like Linz. >>>>>> >>> >>> I am building is like Sipser says which is not like what you assume that >>> he means. >>> >> >> Ok then: >> 3) H_Hat is stipulated to be built like Linz or Sipser, in that it will >> halt when the Halt decider it is built on decides non-Halting. >> > > PROOF We assume that ATM is decidable and obtain a > contradiction. Suppose that H is a decider for ATM. > > Now we construct a new Turing machine D with H as a > subroutine. This new TM calls H to determine what M > does when the input to M is its own description <M>. > Once D has determined this information, it does the > opposite. > > Sipser, Michael 1997. Introduction to the Theory of Computation. Boston: > PWS Publishing Company (165-167) > Ok So in 5, D calls H with M(M), with M being the desciption of this machine D. In 6, H will give an answer, In 7 it does the opposite, so H was wrong. > >> >>>>>> 4) 1 Means that Halts is a Computation, and will always return the >>>>>> same >>>>>> answer (or never return an answer) for a given input. >>>>>> >>>>>> 5) H_Hat when run as a Machine will perform the Computation >>>>>> Halts(H_Hat, >>>>>> H_Hat) >>>>>> >>>>>> 6) by 4 and 2, this means that Halts will return the decision on >>>>>> non-halting to H_Hat >>>>>> >>>>>> 7) By 3, this means that H_Hat will Halt. >>>>>> >>> >>> (8) is wrong. You have brain damage on this key element. >>> That is very strange because this may be the only element that you just >>> can't seem to understand. >> >> So, you say a Computation as proven in 7 will halt is not a Halting >> Computation? Strange definition of Halting, and not compatible with >> Computation Theory. >> > > A finite string specifying an infinite loop has the property of infinite > execution > But H_Hat is NOT a finite string specifiying an infinite loop. > even though the halt decider terminates this loop to report the non > halting property of this infinite loop. Yes, if the Halt Decider tells H_Hat that it would be an infinte loop, it won't be. > >>> >>>>>> 8) This means that H_Hat is a Halting Computation, and becuase of >>>>>> 2, it >>>>>> is wrong. >>>>>> >>>>> >>>>> This part is simply over your head. >>>>> >>>> >>>> Computation Theory seems to be above yours. >>>> >>>> No flaws noted, argument stands, your arguement debunked. >>>> >>> >> > >
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <563-365-8930@kylheku.com> |
|---|---|
| Date | 2021-04-23 04:56 +0000 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <20210422215500.743@kylheku.com> |
| In reply to | #31955 |
On 2021-04-23, olcott <NoOne@NoWhere.com> wrote: > I know that My Halts() does correctly decide its H_Hat(). You're just signaling to the world that you don't understand or respect the verb "to know".
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott2@gmail.com> |
|---|---|
| Date | 2021-04-23 00:04 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <s5tkgm$pcb$1@dont-email.me> |
| In reply to | #31969 |
On 4/22/2021 11:56 PM, Kaz Kylheku wrote:
> On 2021-04-23, olcott <NoOne@NoWhere.com> wrote:
>> I know that My Halts() does correctly decide its H_Hat().
>
> You're just signaling to the world that you don't understand
> or respect the verb "to know".
>
void Infinite_Loop()
{
HERE: goto HERE;
}
void Infinite_Recursion(u32 N)
{
Infinite_Recursion(N);
}
The above two strings both have the property of infinite execution and
it is on this basis that the halt decider stops simulating them and
reports not halting.
--
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-23 07:43 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <_pygI.79221$OF5.1833@fx07.iad> |
| In reply to | #31970 |
On 4/23/21 1:04 AM, olcott wrote:
> On 4/22/2021 11:56 PM, Kaz Kylheku wrote:
>> On 2021-04-23, olcott <NoOne@NoWhere.com> wrote:
>>> I know that My Halts() does correctly decide its H_Hat().
>>
>> You're just signaling to the world that you don't understand
>> or respect the verb "to know".
>>
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> void Infinite_Recursion(u32 N)
> {
> Infinite_Recursion(N);
> }
>
> The above two strings both have the property of infinite execution and
> it is on this basis that the halt decider stops simulating them and
> reports not halting.
>
>
Yes, but that isn't H_Hat.
WRONG. Find the error:
1) Halts is stipulated to meet the requirements of a Halt Decider.
2) Halts is stipulated to return non-Halting on Halts(H_Hat, H_Hat) when
asked direction
3) H_Hat is stipulated to be built like Linz.
4) 1 Means that Halts is a Computation, and will always return the same
answer (or never return an answer) for a given input.
5) H_Hat when run as a Machine will perform the Computation Halts(H_Hat,
H_Hat)
6) by 4 and 2, this means that Halts will return the decision on
non-halting to H_Hat
7) By 3, this means that H_Hat will Halt.
8) This means that H_Hat is a Halting Computation, and becuase of 2, it
is wrong.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-24 01:35 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <874kfwo6xs.fsf@bsb.me.uk> |
| In reply to | #31955 |
olcott <NoOne@NoWhere.com> writes: >> you've made a similar claim before: <cut> >> "The non-halting decider that I defined accepts any and all >> non-halting inputs and rejects any and all halting inputs." > > There is not an instance of any provably undecidable input for my > design that I am aware of. There are no undecidable instances of any decision problem. But this is PO-speak so what you mean is that you know of no input that your design gets wrong. That simply reflects your level of knowledge. Everyone else just knows some things you don't. By the way, "I don't know any cases it gets wrong" is what I call backpedalling when you have previously stated its correctness so categorically. You do that a lot. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 20:13 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <fLidnfympvgY7R79nZ2dnUU7-cnNnZ2d@giganews.com> |
| In reply to | #32043 |
On 4/23/2021 7:35 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >>> you've made a similar claim before: > <cut> >>> "The non-halting decider that I defined accepts any and all >>> non-halting inputs and rejects any and all halting inputs." >> >> There is not an instance of any provably undecidable input for my >> design that I am aware of. > > There are no undecidable instances of any decision problem. So in other words when Linz says that there is no H that can correctly decide halting for a corresponding H^ he is not saying that H^ is an undecidable input for H? > But this is > PO-speak so what you mean is that you know of no input that your design > gets wrong. That simply reflects your level of knowledge. Everyone > else just knows some things you don't. > > By the way, "I don't know any cases it gets wrong" is what I call > backpedalling when you have previously stated its correctness so > categorically. You do that a lot. > -- 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-24 02:53 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87k0osmos8.fsf@bsb.me.uk> |
| In reply to | #32046 |
olcott <NoOne@NoWhere.com> writes: > On 4/23/2021 7:35 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>>> you've made a similar claim before: >> <cut> >>>> "The non-halting decider that I defined accepts any and all >>>> non-halting inputs and rejects any and all halting inputs." >>> >>> There is not an instance of any provably undecidable input for my >>> design that I am aware of. >> >> There are no undecidable instances of any decision problem. > > So in other words when Linz says that there is no H that can correctly > decide halting for a corresponding H^ he is not saying that H^ is an > undecidable input for H? No. In fact I don't think Linz uses that phrasing at all. It's your managerial spin for "an input that H gets wrong". It's not an undecidable instance of the problem. You seem to have real trouble with this. >> But this is >> PO-speak so what you mean is that you know of no input that your design >> gets wrong. That simply reflects your level of knowledge. Everyone >> else just knows some things you don't. >> >> By the way, "I don't know any cases it gets wrong" is what I call >> backpedalling when you have previously stated its correctness so >> categorically. You do that a lot. >> -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 21:03 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <p9qdnfRaGZv84R79nZ2dnUU7-f-dnZ2d@giganews.com> |
| In reply to | #32057 |
On 4/23/2021 8:53 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/23/2021 7:35 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>>> you've made a similar claim before: >>> <cut> >>>>> "The non-halting decider that I defined accepts any and all >>>>> non-halting inputs and rejects any and all halting inputs." >>>> >>>> There is not an instance of any provably undecidable input for my >>>> design that I am aware of. >>> >>> There are no undecidable instances of any decision problem. >> >> So in other words when Linz says that there is no H that can correctly >> decide halting for a corresponding H^ he is not saying that H^ is an >> undecidable input for H? > > No. In fact I don't think Linz uses that phrasing at all. It's your > managerial spin for "an input that H gets wrong". It's not an > undecidable instance of the problem. https://en.wikipedia.org/wiki/List_of_undecidable_problems#Problems_about_abstract_machines > > You seem to have real trouble with this. > >>> But this is >>> PO-speak so what you mean is that you know of no input that your design >>> gets wrong. That simply reflects your level of knowledge. Everyone >>> else just knows some things you don't. >>> >>> By the way, "I don't know any cases it gets wrong" is what I call >>> backpedalling when you have previously stated its correctness so >>> categorically. You do that a lot. >>> > -- 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-24 03:49 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <8735vgmm6k.fsf@bsb.me.uk> |
| In reply to | #32060 |
olcott <NoOne@NoWhere.com> writes: > On 4/23/2021 8:53 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/23/2021 7:35 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>>> you've made a similar claim before: >>>> <cut> >>>>>> "The non-halting decider that I defined accepts any and all >>>>>> non-halting inputs and rejects any and all halting inputs." >>>>> >>>>> There is not an instance of any provably undecidable input for my >>>>> design that I am aware of. >>>> >>>> There are no undecidable instances of any decision problem. >>> >>> So in other words when Linz says that there is no H that can correctly >>> decide halting for a corresponding H^ he is not saying that H^ is an >>> undecidable input for H? >> >> No. In fact I don't think Linz uses that phrasing at all. It's your >> managerial spin for "an input that H gets wrong". It's not an >> undecidable instance of the problem. > > https://en.wikipedia.org/wiki/List_of_undecidable_problems#Problems_about_abstract_machines https://en.wikipedia.org/wiki/Non_sequitur_(literary_device) >> You seem to have real trouble with this. >> >>>> But this is >>>> PO-speak so what you mean is that you know of no input that your design >>>> gets wrong. That simply reflects your level of knowledge. Everyone >>>> else just knows some things you don't. >>>> >>>> By the way, "I don't know any cases it gets wrong" is what I call >>>> backpedalling when you have previously stated its correctness so >>>> categorically. You do that a lot. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 22:16 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <wemdnQXgOO_SEB79nZ2dnUU7-XfNnZ2d@giganews.com> |
| In reply to | #32064 |
On 4/23/2021 9:49 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/23/2021 8:53 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/23/2021 7:35 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>>> you've made a similar claim before: >>>>> <cut> >>>>>>> "The non-halting decider that I defined accepts any and all >>>>>>> non-halting inputs and rejects any and all halting inputs." >>>>>> >>>>>> There is not an instance of any provably undecidable input for my >>>>>> design that I am aware of. >>>>> >>>>> There are no undecidable instances of any decision problem. >>>> >>>> So in other words when Linz says that there is no H that can correctly >>>> decide halting for a corresponding H^ he is not saying that H^ is an >>>> undecidable input for H? >>> >>> No. In fact I don't think Linz uses that phrasing at all. It's your >>> managerial spin for "an input that H gets wrong". It's not an >>> undecidable instance of the problem. >> >> https://en.wikipedia.org/wiki/List_of_undecidable_problems#Problems_about_abstract_machines > > https://en.wikipedia.org/wiki/Non_sequitur_(literary_device) You claimed that the halting problem is not an instance of undecidable problems, I proved that you are wrong about this. > >>> You seem to have real trouble with this. >>> >>>>> But this is >>>>> PO-speak so what you mean is that you know of no input that your design >>>>> gets wrong. That simply reflects your level of knowledge. Everyone >>>>> else just knows some things you don't. >>>>> >>>>> By the way, "I don't know any cases it gets wrong" is what I call >>>>> backpedalling when you have previously stated its correctness so >>>>> categorically. You do that a lot. > -- 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-24 23:02 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87czujl4s3.fsf@bsb.me.uk> |
| In reply to | #32070 |
olcott <NoOne@NoWhere.com> writes: > On 4/23/2021 9:49 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/23/2021 8:53 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 4/23/2021 7:35 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>>> you've made a similar claim before: >>>>>> <cut> >>>>>>>> "The non-halting decider that I defined accepts any and all >>>>>>>> non-halting inputs and rejects any and all halting inputs." >>>>>>> >>>>>>> There is not an instance of any provably undecidable input for my >>>>>>> design that I am aware of. >>>>>> >>>>>> There are no undecidable instances of any decision problem. >>>>> >>>>> So in other words when Linz says that there is no H that can correctly >>>>> decide halting for a corresponding H^ he is not saying that H^ is an >>>>> undecidable input for H? >>>> >>>> No. In fact I don't think Linz uses that phrasing at all. It's your >>>> managerial spin for "an input that H gets wrong". It's not an >>>> undecidable instance of the problem. >>> >>> https://en.wikipedia.org/wiki/List_of_undecidable_problems#Problems_about_abstract_machines >> >> https://en.wikipedia.org/wiki/Non_sequitur_(literary_device) > > You claimed that the halting problem is not an instance of undecidable > problems, I proved that you are wrong about this. No I did not. Look up the thread. I simply corrected an incorrect statement that you made, and you then started to post what seemed to me to be irrelevant remarks. But it seems you thought they were relevant because you thought I'd said something daft! If you can so badly misinterpret "There are no undecidable instances of any decision problem." that you fell you need to tell me that the halting problem is, in fact, undecidable you must frequently think that everyone else is saying insane and contradictory things. You must think we are all mad, or lying or playing head games. Oh you do, often, think that don't you? There is another explanation... -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-22 22:14 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <54qgI.125484$2A5.114701@fx45.iad> |
| In reply to | #31945 |
On 4/22/21 9:24 PM, olcott wrote: > > That is an assumed premise. And you do realize, that when using this form of argument, the MOMENT something disagrees with know facts, the most likely cause is that an assumed premise is wrong. NOT that there is something wrong elsewhere in theory.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-22 21:44 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <d9ydnVubU-PoqR_9nZ2dnUU7-QWdnZ2d@giganews.com> |
| In reply to | #31957 |
On 4/22/2021 9:14 PM, Richard Damon wrote: > On 4/22/21 9:24 PM, olcott wrote: >> >> That is an assumed premise. > > And you do realize, that when using this form of argument, the MOMENT > something disagrees with know facts, the most likely cause is that an > assumed premise is wrong. NOT that there is something wrong elsewhere in > theory. > I am only trying to get Ben to understand the aspect that you already understand to be a tautology. I think that he may understand this now. -- 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-21 07:59 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions) |
| Message-ID | <isUfI.132885$PE7.55391@fx39.iad> |
| In reply to | #31720 |
On 4/20/21 10:50 PM, olcott wrote: > On 4/20/2021 8:15 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/20/2021 5:03 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 4/20/2021 1:27 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 4/20/2021 6:00 AM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 4/19/2021 10:21 PM, Ben Bacarisse wrote: >>>> <cut> >>>>>>>>>> The only problem is that false is the wrong answer for a finite >>>>>>>>>> computation. >>>>>>>>> >>>>>>>>> This must be over your head: >>>>>>>>> When set Q has the same members as set R then we can know that the >>>>>>>>> definition of set Q is equivalent to the definition of set R. >>>>>>>> >>>>>>>> So you don't dispute any of the facts. >>>>>>> >>>>>>> That fact has finally been made moot. >>>>>>> >>>>>>> I can transform one definition into another equivalent definition. >>>>>> >>>>>> Well that simplifies things. >>>>> >>>>> When it is proven that set Q has the exactly same elements as set R >>>>> then this proves that the definition of set Q is equivalent to the >>>>> definition of set R. >>>> >>>> Why do you keep repeating this? >>> >>> To avoid intentionally deceptive "confusion" I require my respondents >>> to acknowledge the validity of one point before moving on to the next >>> point. We can keep going through this same point an infinite number of >>> times. >> >> I see -- it's a ruse to avoid facing the facts. Until you tell me >> otherwise, the facts are that you have "refined halting" so that false >> is the "correct" result for a finite computation: > > Computations that only halted because the halt decider correctly decided > that their simulation must be aborted to prevent their otherwise > infinite execution define the exact same set of elements as the set of > non-halting computations. > But onlu if the decision was correct, and only if it was the Outer Most decider deciding on the outer most version of the program. In Halts(1) -> H_Hat(2) -> Halts(3) -> H_Hat(4) If Hatls(3) can decide that H_Hat(4) needs to be aborted and return that decision to H_Hat(2) and that allows H_Hat(2) to terminate. Then Halts(1) can not validly decide non-halting, becuase H_Hat(2) is halting. H_Hat(2) is non-halting only if Halts(1) and only Halts(1) can stop the recursion. But, if Halts IS a computation, then what ever Halts(1) might be able to decide, so can Halts(3), so Halts(1) has no way to validly prove infinite recursion in this case. You conflate the decisions of Halts(1) and Halts(3) and the behavior of H_Hat(2) and H_Hat(4)
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-21 09:11 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions) |
| Message-ID | <-7-dnYiTDpQBrx39nZ2dnUU7-KOdnZ2d@giganews.com> |
| In reply to | #31742 |
On 4/21/2021 6:59 AM, Richard Damon wrote: > On 4/20/21 10:50 PM, olcott wrote: >> On 4/20/2021 8:15 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/20/2021 5:03 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>> >>>>>> On 4/20/2021 1:27 PM, Ben Bacarisse wrote: >>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>> >>>>>>>> On 4/20/2021 6:00 AM, Ben Bacarisse wrote: >>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>> >>>>>>>>>> On 4/19/2021 10:21 PM, Ben Bacarisse wrote: >>>>> <cut> >>>>>>>>>>> The only problem is that false is the wrong answer for a finite >>>>>>>>>>> computation. >>>>>>>>>> >>>>>>>>>> This must be over your head: >>>>>>>>>> When set Q has the same members as set R then we can know that the >>>>>>>>>> definition of set Q is equivalent to the definition of set R. >>>>>>>>> >>>>>>>>> So you don't dispute any of the facts. >>>>>>>> >>>>>>>> That fact has finally been made moot. >>>>>>>> >>>>>>>> I can transform one definition into another equivalent definition. >>>>>>> >>>>>>> Well that simplifies things. >>>>>> >>>>>> When it is proven that set Q has the exactly same elements as set R >>>>>> then this proves that the definition of set Q is equivalent to the >>>>>> definition of set R. >>>>> >>>>> Why do you keep repeating this? >>>> >>>> To avoid intentionally deceptive "confusion" I require my respondents >>>> to acknowledge the validity of one point before moving on to the next >>>> point. We can keep going through this same point an infinite number of >>>> times. >>> >>> I see -- it's a ruse to avoid facing the facts. Until you tell me >>> otherwise, the facts are that you have "refined halting" so that false >>> is the "correct" result for a finite computation: >> >> Computations that only halted because the halt decider correctly decided >> that their simulation must be aborted to prevent their otherwise >> infinite execution define the exact same set of elements as the set of >> non-halting computations. >> > > But onlu if the decision was correct, and only if it was the Outer Most > decider deciding on the outer most version of the program. Scrambled eggs for brains, apparently. -- 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-21 11:16 -0400 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions) |
| Message-ID | <tlXfI.20544$b27.17769@fx03.iad> |
| In reply to | #31751 |
On 4/21/21 10:11 AM, olcott wrote: > On 4/21/2021 6:59 AM, Richard Damon wrote: >> On 4/20/21 10:50 PM, olcott wrote: >>> On 4/20/2021 8:15 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>> >>>>> On 4/20/2021 5:03 PM, Ben Bacarisse wrote: >>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> >>>>>>> On 4/20/2021 1:27 PM, Ben Bacarisse wrote: >>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>> >>>>>>>>> On 4/20/2021 6:00 AM, Ben Bacarisse wrote: >>>>>>>>>> olcott <NoOne@NoWhere.com> writes: >>>>>>>>>> >>>>>>>>>>> On 4/19/2021 10:21 PM, Ben Bacarisse wrote: >>>>>> <cut> >>>>>>>>>>>> The only problem is that false is the wrong answer for a finite >>>>>>>>>>>> computation. >>>>>>>>>>> >>>>>>>>>>> This must be over your head: >>>>>>>>>>> When set Q has the same members as set R then we can know >>>>>>>>>>> that the >>>>>>>>>>> definition of set Q is equivalent to the definition of set R. >>>>>>>>>> >>>>>>>>>> So you don't dispute any of the facts. >>>>>>>>> >>>>>>>>> That fact has finally been made moot. >>>>>>>>> >>>>>>>>> I can transform one definition into another equivalent definition. >>>>>>>> >>>>>>>> Well that simplifies things. >>>>>>> >>>>>>> When it is proven that set Q has the exactly same elements as set R >>>>>>> then this proves that the definition of set Q is equivalent to the >>>>>>> definition of set R. >>>>>> >>>>>> Why do you keep repeating this? >>>>> >>>>> To avoid intentionally deceptive "confusion" I require my respondents >>>>> to acknowledge the validity of one point before moving on to the next >>>>> point. We can keep going through this same point an infinite number of >>>>> times. >>>> >>>> I see -- it's a ruse to avoid facing the facts. Until you tell me >>>> otherwise, the facts are that you have "refined halting" so that false >>>> is the "correct" result for a finite computation: >>> >>> Computations that only halted because the halt decider correctly decided >>> that their simulation must be aborted to prevent their otherwise >>> infinite execution define the exact same set of elements as the set of >>> non-halting computations. >>> >> >> But onlu if the decision was correct, and only if it was the Outer Most >> decider deciding on the outer most version of the program. > > Scrambled eggs for brains, apparently. > > > Good self description of yourself. The fact that a decider decided to halt the simulation is not in itself proof that it had to. Also, you seem to have a hard time understanding that if the copy of Halts that is with H_Hat decides to terminate it simulation of the input given to it ba H_Hat, and return its answer to H_Hat, that is DIFFERENT than the top most call to Halt that is deciding on H_Hat needing to terminate H_Hat. The first case is the logic within H_Hat (inherited from Halts) deciding to limit itself and result in a finite computation, while the later, if it actually was a correct decision would show infinite execution. The issue is that if Halts IS a Computation (and if not it doesn't qualify as a Halt Decider) then if the top level detects the possible infinite recursion, then so will the embedded copy, and when that one makes that same decision, the results will be that H_Hat will have finite execution. It is trivial to PROVE, from fundamental definitions and the stipulation that Halts is a Computation and that Halts(H_Hat, H_Hat) returned non-halting when run as a top level machine, that H_Hat will have finite execution. This is a SIMPLE proof. And it proves that Halts was wrong in its decision. If you claim you can prove that Halts was right in its decision, then we have the classical case of an inconsistent logic system, almost certainly due to some added stipulation in your logic. To show that your logic system is NOT inconsistent, you need to find a factual logical error in the logic of the proof that H_Hat is halting, (Not just showing a counter example to some statement). Since it is based on just those two stipulations and the definitions of the problem, this will be something very hard to do.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-04-18 22:23 -0400 |
| Subject | Re: Infinite recursion detection criteria: X() simulates Y() |
| Message-ID | <NQ5fI.18655$b27.1077@fx03.iad> |
| In reply to | #31420 |
On 4/18/21 9:40 PM, olcott wrote: > A stipulative definition is a type of definition in which a new or > currently existing term is given a new specific meaning for the purposes > of argument or discussion in a given context. > https://en.wikipedia.org/wiki/Stipulative_definition > > If this is the stipulative definition of: > "a non-halting computation." > > On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >> A computation that would not halt if its simulation were not >> halted is indeed a non-halting computation. Redefining a core definition IMMEDIATELY invalidates ANY use of your 'proof' to the standard theory with the conventional definition. BYE. > > Then as long as this criteria is met > "A computation that would not halt if its simulation were not halted" > > Then the stipulative definition entails: > "is indeed a non-halting computation." > > I thought that you understood that the only dichotomy that a halt > decider based on simulating it input can address is > (a) Input forced to halt > (b) Input halted on its own > > thus making it computationally equivalent to: > (a) Input would not halt > (b) Input would halt > 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.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-18 21:25 -0500 |
| Subject | Re: Infinite recursion detection criteria: X() simulates Y() |
| Message-ID | <3vidnZDWgbOxd-H9nZ2dnUU7-WGdnZ2d@giganews.com> |
| In reply to | #31426 |
On 4/18/2021 9:23 PM, Richard Damon wrote: > On 4/18/21 9:40 PM, olcott wrote: > >> A stipulative definition is a type of definition in which a new or >> currently existing term is given a new specific meaning for the purposes >> of argument or discussion in a given context. >> https://en.wikipedia.org/wiki/Stipulative_definition >> >> If this is the stipulative definition of: >> "a non-halting computation." >> >> On 11/27/2020 9:02 PM, Ben Bacarisse wrote: >>> A computation that would not halt if its simulation were not >>> halted is indeed a non-halting computation. > > Redefining a core definition IMMEDIATELY invalidates ANY use of your > 'proof' to the standard theory with the conventional definition. > > BYE. > >> >> Then as long as this criteria is met >> "A computation that would not halt if its simulation were not halted" >> >> Then the stipulative definition entails: >> "is indeed a non-halting computation." >> >> I thought that you understood that the only dichotomy that a halt >> decider based on simulating it input can address is >> (a) Input forced to halt >> (b) Input halted on its own >> >> thus making it computationally equivalent to: >> (a) Input would not halt >> (b) Input would halt >> > > 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. -- 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 07:26 -0400 |
| Subject | Re: Infinite recursion detection criteria: X() simulates Y() |
| Message-ID | <rNdfI.16461$9L1.14125@fx05.iad> |
| In reply to | #31428 |
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. This even invalidates you black cats are black argument because with your logic, you allow someone to now stipulate that cats are non-blank animals, and thus your proof now fails. You are not God. You have no power to change things that others can not also change. Change core definitions and you remove yourself from this system. STIPULATION: Peter Olcott is a crank. Done.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-19 10:16 -0500 |
| Subject | Re: Infinite recursion detection criteria: X() simulates Y() |
| Message-ID | <-ZKdnUIUJO9XA-D9nZ2dnUU7-dGdnZ2d@giganews.com> |
| In reply to | #31444 |
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. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 6 of 8 — ← Prev page 1 2 3 4 5 [6] 7 8 Next page →
Back to top | Article view | comp.theory
csiph-web