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 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8 Next page →
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-22 18:47 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <ceWdnfwasYe5lh_9nZ2dnUU7-fGdnZ2d@giganews.com> |
| In reply to | #31929 |
On 4/22/2021 6:41 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/22/2021 7:15 AM, Ben Bacarisse wrote: > ... >>> This sentence... > > ... I've cut all of my text because I don't think you were commenting on > any of it. Your whole repl appears to stand alone as a summary of your > current position. > >> The Turing Machine Halting Problem >> We begin with some problems... > > It is considered the height of bad manners to quote people without > attribution. Innocent readers might think that you wrote this as they > won't know the golden rule: if it makes sense, it's probably a quote. > >> As required by Definition >> 12.1, we want H to operate according to the following rules: >> >> H.q0 wMw ⊢* H.qy >> H.q0 wMw ⊢* H.qn > > But this is worse manners. Linz did not write those two lines, and the > lines he did write (the correct ones) were augmented by text that you > consistently omit, presumably because you don't know how to use his > notation. No cookie. > >> 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. > > So not what you wrote above. > >> (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. > > A bit vague. I like the "all the details" so you don't actually have to > say what you maintain. After all, you probably don't know what details > you need yet, so keep them all. > >> (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. What's more, I know a > theorem that states that this is not possible (unless you are using > PO-words again). > > You have never given any hint as to how a TM computation's sequence of > configurations can be used to decide halting. (Infallibly detecting > infinite execution is the same as deciding halting.) > > You have assumed your desired result and you don't need anything more. > Once F has infallibly detected non-halting, F can report the result. > Job done. Anything else that F does, or that wrap round F is there for > the purposes of obfuscation only. > >> (g) At the point where F infallibly detects the infinite execution of >> its input pair F decides to stop simulating its input. > > It should enter a rejecting state. And if, at step (d), the simulated > computation halts, F should enter an accepting state. Job done. F is > now a halting decider. > > I'll comment on the rest (which is must less clear) if you ask me to, > but since you seem to be saying that you have (or could have) an > impossible TM, it seems irrelevant. The steps (a) to (g) appear to be > what you have been talking about all along, so I don't see the advantage > in going into the mucky, unclear bits unless it's really needed. > Here is the simpified version: When a halt decider correctly decides to stop simulating its input because this input would never otherwise halt this halt decider has correctly decided not halting on this input. -- 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-23 01:12 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87y2d9q2ns.fsf@bsb.me.uk> |
| In reply to | #31930 |
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. What's more, I know a >> theorem that states that this is not possible (unless you are using >> PO-words again). >> >> You have never given any hint as to how a TM computation's sequence of >> configurations can be used to decide halting. (Infallibly detecting >> infinite execution is the same as deciding halting.) >> >> You have assumed your desired result and you don't need anything more. >> Once F has infallibly detected non-halting, F can report the result. >> Job done. Anything else that F does, or that wrap round F is there for >> the purposes of obfuscation only. >> >>> (g) At the point where F infallibly detects the infinite execution of >>> its input pair F decides to stop simulating its input. >> >> It should enter a rejecting state. And if, at step (d), the simulated >> computation halts, F should enter an accepting state. Job done. F is >> now a halting decider. Can you come clean about this, please? You start by assuming a TM F with these properties. Do believe that such a TM exists? Do you go so far as to claim to have such a TM? It looks for all the world like you are describing the Halts code you sketch before but in the more formal terms of a TM, but maybe you wrote it all just to say, later, that it can't be done. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-22 19:15 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <Lc-dnRjtI5kxjB_9nZ2dnUU7-fmdnZ2d@giganews.com> |
| In reply to | #31935 |
On 4/22/2021 7:12 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. What's more, I know a >>> theorem that states that this is not possible (unless you are using >>> PO-words again). >>> >>> You have never given any hint as to how a TM computation's sequence of >>> configurations can be used to decide halting. (Infallibly detecting >>> infinite execution is the same as deciding halting.) >>> >>> You have assumed your desired result and you don't need anything more. >>> Once F has infallibly detected non-halting, F can report the result. >>> Job done. Anything else that F does, or that wrap round F is there for >>> the purposes of obfuscation only. >>> >>>> (g) At the point where F infallibly detects the infinite execution of >>>> its input pair F decides to stop simulating its input. >>> >>> It should enter a rejecting state. And if, at step (d), the simulated >>> computation halts, F should enter an accepting state. Job done. F is >>> now a halting decider. > > Can you come clean about this, please? You start by assuming a TM F > with these properties. Do believe that such a TM exists? Do you go so > far as to claim to have such a TM? > > It looks for all the world like you are describing the Halts code you > sketch before but in the more formal terms of a TM, but maybe you wrote > it all just to say, later, that it can't be done. > All the above is made moot by this tautology, do you agree with it or not? When a halt decider correctly decides to stop simulating its input because this input would never otherwise halt this halt decider has correctly decided not halting on this input. -- 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-23 02:05 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <875z0dq08d.fsf@bsb.me.uk> |
| In reply to | #31937 |
olcott <NoOne@NoWhere.com> writes: > On 4/22/2021 7:12 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. What's more, I know a >>>> theorem that states that this is not possible (unless you are using >>>> PO-words again). >>>> >>>> You have never given any hint as to how a TM computation's sequence of >>>> configurations can be used to decide halting. (Infallibly detecting >>>> infinite execution is the same as deciding halting.) >>>> >>>> You have assumed your desired result and you don't need anything more. >>>> Once F has infallibly detected non-halting, F can report the result. >>>> Job done. Anything else that F does, or that wrap round F is there for >>>> the purposes of obfuscation only. >>>> >>>>> (g) At the point where F infallibly detects the infinite execution of >>>>> its input pair F decides to stop simulating its input. >>>> >>>> It should enter a rejecting state. And if, at step (d), the simulated >>>> computation halts, F should enter an accepting state. Job done. F is >>>> now a halting decider. >> >> Can you come clean about this, please? You start by assuming a TM F >> with these properties. Do believe that such a TM exists? Do you go so >> far as to claim to have such a TM? >> >> It looks for all the world like you are describing the Halts code you >> sketch before but in the more formal terms of a TM, but maybe you wrote >> it all just to say, later, that it can't be done. > > All the above is made moot by this tautology, No tautology alters any facts about the above and you know it. I've been telling you about this problem in your claim for months now and I suspect you've just worked out what I've been talking about. A straight answer would be appreciated. If you have any trouble with the questions (Do believe that such a TM exists? Do you go so far as to claim to have such a TM?) just ask what is unclear about them and I'll do my best to explain. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-22 20:12 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <ePedncHoIYmYgh_9nZ2dnUU7-XfNnZ2d@giganews.com> |
| In reply to | #31941 |
On 4/22/2021 8:05 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/22/2021 7:12 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. What's more, I know a >>>>> theorem that states that this is not possible (unless you are using >>>>> PO-words again). >>>>> >>>>> You have never given any hint as to how a TM computation's sequence of >>>>> configurations can be used to decide halting. (Infallibly detecting >>>>> infinite execution is the same as deciding halting.) >>>>> >>>>> You have assumed your desired result and you don't need anything more. >>>>> Once F has infallibly detected non-halting, F can report the result. >>>>> Job done. Anything else that F does, or that wrap round F is there for >>>>> the purposes of obfuscation only. >>>>> >>>>>> (g) At the point where F infallibly detects the infinite execution of >>>>>> its input pair F decides to stop simulating its input. >>>>> >>>>> It should enter a rejecting state. And if, at step (d), the simulated >>>>> computation halts, F should enter an accepting state. Job done. F is >>>>> now a halting decider. >>> >>> Can you come clean about this, please? You start by assuming a TM F >>> with these properties. Do believe that such a TM exists? Do you go so >>> far as to claim to have such a TM? >>> >>> It looks for all the world like you are describing the Halts code you >>> sketch before but in the more formal terms of a TM, but maybe you wrote >>> it all just to say, later, that it can't be done. >> >> All the above is made moot by this tautology, > > No tautology alters any facts about the above and you know it. I've > been telling you about this problem in your claim for months now and I > suspect you've just worked out what I've been talking about. > > A straight answer would be appreciated. If you have any trouble with > the questions (Do believe that such a TM exists? Do you go so far as to > claim to have such a TM?) just ask what is unclear about them and I'll > do my best to explain. > I changed it back to my words because your words provided a less tautological basis. When a TM correctly decides to stop simulating its input because this input would never otherwise halt this TM has correctly decided not halting on this input even after the TM forces it to halt. -- 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-23 02:37 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87zgxpok6i.fsf@bsb.me.uk> |
| In reply to | #31944 |
olcott <NoOne@NoWhere.com> writes: > On 4/22/2021 8:05 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/22/2021 7:12 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. What's more, I know a >>>>>> theorem that states that this is not possible (unless you are using >>>>>> PO-words again). >>>>>> >>>>>> You have never given any hint as to how a TM computation's sequence of >>>>>> configurations can be used to decide halting. (Infallibly detecting >>>>>> infinite execution is the same as deciding halting.) >>>>>> >>>>>> You have assumed your desired result and you don't need anything more. >>>>>> Once F has infallibly detected non-halting, F can report the result. >>>>>> Job done. Anything else that F does, or that wrap round F is there for >>>>>> the purposes of obfuscation only. >>>>>> >>>>>>> (g) At the point where F infallibly detects the infinite execution of >>>>>>> its input pair F decides to stop simulating its input. >>>>>> >>>>>> It should enter a rejecting state. And if, at step (d), the simulated >>>>>> computation halts, F should enter an accepting state. Job done. F is >>>>>> now a halting decider. >>>> >>>> Can you come clean about this, please? You start by assuming a TM F >>>> with these properties. Do believe that such a TM exists? Do you go so >>>> far as to claim to have such a TM? >>>> >>>> It looks for all the world like you are describing the Halts code you >>>> sketch before but in the more formal terms of a TM, but maybe you wrote >>>> it all just to say, later, that it can't be done. >>> >>> All the above is made moot by this tautology, >> >> No tautology alters any facts about the above and you know it. I've >> been telling you about this problem in your claim for months now and I >> suspect you've just worked out what I've been talking about. >> >> A straight answer would be appreciated. If you have any trouble with >> the questions (Do believe that such a TM exists? Do you go so far as to >> claim to have such a TM?) just ask what is unclear about them and I'll >> do my best to explain. > > I changed it back to my words because your words provided a less > tautological basis. Please answer my questions. You carefully describe an F that looks very much like the code you've been talking about for months. Do you believe that such a TM exists? I can't see why you'd got to the bother of being so clear and so detailed to describe something that you think is impossible. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-22 20:44 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <95udnUaFmfYeux_9nZ2dnUU7-V2dnZ2d@giganews.com> |
| In reply to | #31946 |
On 4/22/2021 8:37 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/22/2021 8:05 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/22/2021 7:12 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. What's more, I know a >>>>>>> theorem that states that this is not possible (unless you are using >>>>>>> PO-words again). >>>>>>> >>>>>>> You have never given any hint as to how a TM computation's sequence of >>>>>>> configurations can be used to decide halting. (Infallibly detecting >>>>>>> infinite execution is the same as deciding halting.) >>>>>>> >>>>>>> You have assumed your desired result and you don't need anything more. >>>>>>> Once F has infallibly detected non-halting, F can report the result. >>>>>>> Job done. Anything else that F does, or that wrap round F is there for >>>>>>> the purposes of obfuscation only. >>>>>>> >>>>>>>> (g) At the point where F infallibly detects the infinite execution of >>>>>>>> its input pair F decides to stop simulating its input. >>>>>>> >>>>>>> It should enter a rejecting state. And if, at step (d), the simulated >>>>>>> computation halts, F should enter an accepting state. Job done. F is >>>>>>> now a halting decider. >>>>> >>>>> Can you come clean about this, please? You start by assuming a TM F >>>>> with these properties. Do believe that such a TM exists? Do you go so >>>>> far as to claim to have such a TM? >>>>> >>>>> It looks for all the world like you are describing the Halts code you >>>>> sketch before but in the more formal terms of a TM, but maybe you wrote >>>>> it all just to say, later, that it can't be done. >>>> >>>> All the above is made moot by this tautology, >>> >>> No tautology alters any facts about the above and you know it. I've >>> been telling you about this problem in your claim for months now and I >>> suspect you've just worked out what I've been talking about. >>> >>> A straight answer would be appreciated. If you have any trouble with >>> the questions (Do believe that such a TM exists? Do you go so far as to >>> claim to have such a TM?) just ask what is unclear about them and I'll >>> do my best to explain. >> >> I changed it back to my words because your words provided a less >> tautological basis. > > Please answer my questions. You carefully describe an F that looks very > much like the code you've been talking about for months. Do you believe > that such a TM exists? > > I can't see why you'd got to the bother of being so clear and so detailed > to describe something that you think is impossible. > What I described is how Halts() correctly decides halting on H_Hat(). Every finite string that has the property of infinite execution seems to contradict this property when it is forced to halt. -- 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 01:27 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87a6poo7c5.fsf@bsb.me.uk> |
| In reply to | #31947 |
olcott <NoOne@NoWhere.com> writes: > On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >> Please answer my questions. You carefully describe an F that looks very >> much like the code you've been talking about for months. Do you believe >> that such a TM exists? >> >> I can't see why you'd got to the bother of being so clear and so detailed >> to describe something that you think is impossible. > > What I described is how Halts() correctly decides halting on H_Hat(). Backpedalling, incompetence or lying -- I am not sure which yet. You describe a Turing machine F and describe its action on an arbitrary input. You even include explicit universally quantified formulas about F "for all" inputs. Here are the properties of the imagined F: (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. (g) At the point where F infallibly detects the infinite execution of its input pair F decides to stop simulating its input. Are you backpedalling on this and you now want us to believe you meant that F can only do this reliably for one specific input? Or are you incompetent and always meant to say that but you simply didn't know what ∀ means or how to write (a) to (g) without making it a sounds like a universal claim? Or are you lying and you meant exactly what wrote but want to flat-out deny it now? Finally, at the forth time of asking, do you believe that a machine F as you described it exists? I'm not asking about what you now might want us to think you meant, I am asking about what you actually wrote. It was remarkably clear, and even if it was not what you meant, a clear answer to this question would go a long way to illuminate what you are thinking. (Obviously, I don't really expect answers, but for a lot of crank ideas the best one can hope for is a trail of unanswered questions for future readers to come across.) > Every finite string that has the property of infinite execution seems > to contradict this property when it is forced to halt. Goodness that is badly written. I could try to ascribe some meaning to it but I don't see how that would help since you would most likely reject my interpretation, but if you want it, I'll have a go. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 19:53 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <iOmdnV4q0-F49h79nZ2dnUU7-evNnZ2d@giganews.com> |
| In reply to | #32042 |
On 4/23/2021 7:27 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote:
>
>>> Please answer my questions. You carefully describe an F that looks very
>>> much like the code you've been talking about for months. Do you believe
>>> that such a TM exists?
>>>
>>> I can't see why you'd got to the bother of being so clear and so detailed
>>> to describe something that you think is impossible.
>>
>> What I described is how Halts() correctly decides halting on H_Hat().
>
> Backpedalling, incompetence or lying -- I am not sure which yet.
I am not going to bother to read all that yet will say that your halting
criteria would decide that the following finite string specifies a
halting comutputation on the basis that its simulator would stop
simulating it.
void Infinite_Loop()
{
HERE: goto HERE;
}
--
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:34 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <87v98cmpmn.fsf@bsb.me.uk> |
| In reply to | #32045 |
olcott <NoOne@NoWhere.com> writes:
> On 4/23/2021 7:27 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote:
>>
>>>> Please answer my questions. You carefully describe an F that looks very
>>>> much like the code you've been talking about for months. Do you believe
>>>> that such a TM exists?
>>>>
>>>> I can't see why you'd got to the bother of being so clear and so detailed
>>>> to describe something that you think is impossible.
>>>
>>> What I described is how Halts() correctly decides halting on H_Hat().
>>
>> Backpedalling, incompetence or lying -- I am not sure which yet.
>
> I am not going to bother to read all that...
That's up to you.
Since you won't answer my questions I shall state what I see. You used
the clarity of Turing machines to explain what your Halts function is
doing:
(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.
(g) At the point where F infallibly detects the infinite execution of
its input pair F decides to stop simulating its input.
This is a halt decider in all but name (two transitions, one to an
accepting state and one to a rejecting state are all that need be added
to f to make it one), so I asked if you believed that such an F exists,
or if in fact you claim to actually have such an F.
This is the fifth time I've asked. Not reading what I write is probably
the best you can do at this stage because you really want to avoid these
questions.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 21:00 -0500 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <p9qdnfVaGZsH5h79nZ2dnUU7-f_NnZ2d@giganews.com> |
| In reply to | #32051 |
On 4/23/2021 8:34 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote:
>>>
>>>>> Please answer my questions. You carefully describe an F that looks very
>>>>> much like the code you've been talking about for months. Do you believe
>>>>> that such a TM exists?
>>>>>
>>>>> I can't see why you'd got to the bother of being so clear and so detailed
>>>>> to describe something that you think is impossible.
>>>>
>>>> What I described is how Halts() correctly decides halting on H_Hat().
>>>
>>> Backpedalling, incompetence or lying -- I am not sure which yet.
>>
>> I am not going to bother to read all that...
>
> That's up to you.
>
> Since you won't answer my questions I shall state what I see. You used
> the clarity of Turing machines to explain what your Halts function is
> doing:
>
> (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.
> (g) At the point where F infallibly detects the infinite execution of
> its input pair F decides to stop simulating its input.
>
> This is a halt decider in all but name (two transitions, one to an
> accepting state and one to a rejecting state are all that need be added
> to f to make it one), so I asked if you believed that such an F exists,
> or if in fact you claim to actually have such an F.
I have explained that my purpose is to defeat the conventional counter
examples.
When a TM correctly decides to stop simulating its input because this
input would never otherwise halt this TM has correctly decided not
halting on this input.
∀x ∈ Turing_Machine_Descriptions Must_be_Stopped(x) ≡ ¬Halting(x)
In other words when the above English criteria is met then (e) is fully
satisfied.
http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
> This is the fifth time I've asked. Not reading what I write is probably
> the best you can do at this stage because you really want to avoid these
> questions.
>
When a TM correctly decides to stop simulating its input because this
input would never otherwise halt this TM has correctly decided not
halting on this input.
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
void Infinite_Loop()
{
HERE: goto HERE;
}
void Infinite_Recursion(u32 N)
{
Infinite_Recursion(N);
}
int main()
{
Halts((u32)H_Hat, (u32)H_Hat);
}
All of the above cases meet the above English criteria.
--
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 22:24 -0400 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <qjLgI.79482$OF5.1470@fx07.iad> |
| In reply to | #32058 |
On 4/23/21 10:00 PM, olcott wrote:
> On 4/23/2021 8:34 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote:
>>>>
>>>>>> Please answer my questions. You carefully describe an F that
>>>>>> looks very
>>>>>> much like the code you've been talking about for months. Do you
>>>>>> believe
>>>>>> that such a TM exists?
>>>>>>
>>>>>> I can't see why you'd got to the bother of being so clear and so
>>>>>> detailed
>>>>>> to describe something that you think is impossible.
>>>>>
>>>>> What I described is how Halts() correctly decides halting on H_Hat().
>>>>
>>>> Backpedalling, incompetence or lying -- I am not sure which yet.
>>>
>>> I am not going to bother to read all that...
>>
>> That's up to you.
>>
>> Since you won't answer my questions I shall state what I see. You used
>> the clarity of Turing machines to explain what your Halts function is
>> doing:
>>
>> (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.
>> (g) At the point where F infallibly detects the infinite execution of
>> its input pair F decides to stop simulating its input.
>>
>> This is a halt decider in all but name (two transitions, one to an
>> accepting state and one to a rejecting state are all that need be added
>> to f to make it one), so I asked if you believed that such an F exists,
>> or if in fact you claim to actually have such an F.
>
> I have explained that my purpose is to defeat the conventional counter
> examples.
And you do realize that showing you can 'prove' the opposite results of
a conventional proof does NOT 'defeat' that proof? If it did, then you
could just as easily say that that proof defeats yours.
In actuality, all it shows is that either there is a logical error in
one of the proofs or the other, or that the logical system has become
inconsistent, and thus pretty much worthless.
If in doing so, you have added any assumptions or changed any
definitions, then the simplest conclusion is that those additions or
changes are the cause of the inconsistancy, and thus they are the problem.
>
> When a TM correctly decides to stop simulating its input because this
> input would never otherwise halt this TM has correctly decided not
> halting on this input.
>
Yes, you are trying to change the deciding conditions, and it is most
likely this slight change that make the logic system inconsistant, and
thus the problem.
THe ACTUAL definition of Halting is based on the actual behavior of the
actual machine when it is run, and the actual definition of correctly
deciding is that the deciders output matched this behavior.
Part of your problem is that the phrase correctly decides ... would
never otherwise halt can't be used to decide if something is halting, as
the machine halting defines if it the decision was correct. You are
having the tail wag the dog.
> ∀x ∈ Turing_Machine_Descriptions Must_be_Stopped(x) ≡ ¬Halting(x)
>
> In other words when the above English criteria is met then (e) is fully
> satisfied.
>
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf
>
>
>> This is the fifth time I've asked. Not reading what I write is probably
>> the best you can do at this stage because you really want to avoid these
>> questions.
>>
>
> When a TM correctly decides to stop simulating its input because this
> input would never otherwise halt this TM has correctly decided not
> halting on this input.
>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> }
>
> void Infinite_Recursion(u32 N)
> {
> Infinite_Recursion(N);
> }
>
> int main()
> {
> Halts((u32)H_Hat, (u32)H_Hat);
> }
>
> All of the above cases meet the above English criteria.
>
>
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-04-24 03:45 +0100 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <878s58mmdr.fsf@bsb.me.uk> |
| In reply to | #32058 |
olcott <NoOne@NoWhere.com> writes: > On 4/23/2021 8:34 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >>>> >>>>>> Please answer my questions. You carefully describe an F that looks very >>>>>> much like the code you've been talking about for months. Do you believe >>>>>> that such a TM exists? >>>>>> >>>>>> I can't see why you'd got to the bother of being so clear and so detailed >>>>>> to describe something that you think is impossible. >>>>> >>>>> What I described is how Halts() correctly decides halting on H_Hat(). >>>> >>>> Backpedalling, incompetence or lying -- I am not sure which yet. >>> >>> I am not going to bother to read all that... >> >> That's up to you. >> >> Since you won't answer my questions I shall state what I see. You used >> the clarity of Turing machines to explain what your Halts function is >> doing: >> >> (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. >> (g) At the point where F infallibly detects the infinite execution of >> its input pair F decides to stop simulating its input. >> >> This is a halt decider in all but name (two transitions, one to an >> accepting state and one to a rejecting state are all that need be added >> to f to make it one), so I asked if you believed that such an F exists, >> or if in fact you claim to actually have such an F. > > I have explained that my purpose is to defeat the conventional counter > examples. Yes, I know your supposed purpose. I am asking about what you said and you are running from that question (this is probably the sixth time you have avoided answering it). You won't answer because you know accidentally tipped your hand (again). -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 22:00 -0500 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <YYudne0eUJFfFB79nZ2dnUU7-aXNnZ2d@giganews.com> |
| In reply to | #32063 |
On 4/23/2021 9:45 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/23/2021 8:34 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >>>>> >>>>>>> Please answer my questions. You carefully describe an F that looks very >>>>>>> much like the code you've been talking about for months. Do you believe >>>>>>> that such a TM exists? >>>>>>> >>>>>>> I can't see why you'd got to the bother of being so clear and so detailed >>>>>>> to describe something that you think is impossible. >>>>>> >>>>>> What I described is how Halts() correctly decides halting on H_Hat(). >>>>> >>>>> Backpedalling, incompetence or lying -- I am not sure which yet. >>>> >>>> I am not going to bother to read all that... >>> >>> That's up to you. >>> >>> Since you won't answer my questions I shall state what I see. You used >>> the clarity of Turing machines to explain what your Halts function is >>> doing: >>> >>> (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. >>> (g) At the point where F infallibly detects the infinite execution of >>> its input pair F decides to stop simulating its input. >>> >>> This is a halt decider in all but name (two transitions, one to an >>> accepting state and one to a rejecting state are all that need be added >>> to f to make it one), so I asked if you believed that such an F exists, >>> or if in fact you claim to actually have such an F. >> >> I have explained that my purpose is to defeat the conventional counter >> examples. > > Yes, I know your supposed purpose. I am asking about what you said and > you are running from that question (this is probably the sixth time you > have avoided answering it). You won't answer because you know > accidentally tipped your hand (again). > https://en.wikipedia.org/wiki/Googolplex I don't have any idea how some of these other undecidable problems could be addressed. It might be the case that a googolplex of quantum computers all working in parallel could use brute force to solve increasingly complex instances of the Busy Beaver problem. https://en.wikipedia.org/wiki/List_of_undecidable_problems#Problems_about_abstract_machines -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 22:02 -0500 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <YYudneweUJGJFx79nZ2dnUU7-aVQAAAA@giganews.com> |
| In reply to | #32063 |
On 4/23/2021 9:45 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/23/2021 8:34 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>> >>>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote: >>>>> olcott <NoOne@NoWhere.com> writes: >>>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >>>>> >>>>>>> Please answer my questions. You carefully describe an F that looks very >>>>>>> much like the code you've been talking about for months. Do you believe >>>>>>> that such a TM exists? >>>>>>> >>>>>>> I can't see why you'd got to the bother of being so clear and so detailed >>>>>>> to describe something that you think is impossible. >>>>>> >>>>>> What I described is how Halts() correctly decides halting on H_Hat(). >>>>> >>>>> Backpedalling, incompetence or lying -- I am not sure which yet. >>>> >>>> I am not going to bother to read all that... >>> >>> That's up to you. >>> >>> Since you won't answer my questions I shall state what I see. You used >>> the clarity of Turing machines to explain what your Halts function is >>> doing: >>> >>> (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. >>> (g) At the point where F infallibly detects the infinite execution of >>> its input pair F decides to stop simulating its input. >>> >>> This is a halt decider in all but name (two transitions, one to an >>> accepting state and one to a rejecting state are all that need be added >>> to f to make it one), so I asked if you believed that such an F exists, >>> or if in fact you claim to actually have such an F. >> >> I have explained that my purpose is to defeat the conventional counter >> examples. > > Yes, I know your supposed purpose. I am asking about what you said and > you are running from that question (this is probably the sixth time you > have avoided answering it). You won't answer because you know > accidentally tipped your hand (again). > The rest of what I said proves that I am right that is why you made sure too ignore it. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-23 23:57 -0500 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <s86dnbimRKSAOB79nZ2dnUU7-YPNnZ2d@giganews.com> |
| In reply to | #32051 |
On 4/23/2021 8:34 PM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> On 4/23/2021 7:27 PM, Ben Bacarisse wrote: >>> olcott <NoOne@NoWhere.com> writes: >>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >>> >>>>> Please answer my questions. You carefully describe an F that looks very >>>>> much like the code you've been talking about for months. Do you believe >>>>> that such a TM exists? >>>>> >>>>> I can't see why you'd got to the bother of being so clear and so detailed >>>>> to describe something that you think is impossible. >>>> >>>> What I described is how Halts() correctly decides halting on H_Hat(). >>> >>> Backpedalling, incompetence or lying -- I am not sure which yet. >> >> I am not going to bother to read all that... > > That's up to you. > > Since you won't answer my questions I shall state what I see. You used > the clarity of Turing machines to explain what your Halts function is > doing: > > (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. When a TM correctly decides to stop simulating its input because this input would never otherwise halt this TM has correctly decided not halting on this input. ∀x ∈ Turing_Machine_Descriptions Must_be_Stopped(x) ≡ ¬Halting(x) In other words when the above English criteria is met then (e) is fully satisfied. http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf > (g) At the point where F infallibly detects the infinite execution of > its input pair F decides to stop simulating its input. > > This is a halt decider in all but name (two transitions, one to an > accepting state and one to a rejecting state are all that need be added > to f to make it one), so I asked if you believed that such an F exists, > or if in fact you claim to actually have such an F. > I believe that I have the beginning basis for solving the halting problem. It cracks the door open by showing how a Sipser TM H can correctly decide a Sipser TM D. > This is the fifth time I've asked. Not reading what I write is probably > the best you can do at this stage because you really want to avoid these > questions. > -- 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:42 +0100 |
| Subject | Re: Infinite recursion detection criteria: (equivalent definitions)(easier?) |
| Message-ID | <877dkrl2y9.fsf@bsb.me.uk> |
| In reply to | #32075 |
olcott <NoOne@NoWhere.com> writes: > On 4/23/2021 8:34 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote: >>>> olcott <NoOne@NoWhere.com> writes: >>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote: >>>> >>>>>> Please answer my questions. You carefully describe an F that looks very >>>>>> much like the code you've been talking about for months. Do you believe >>>>>> that such a TM exists? >>>>>> >>>>>> I can't see why you'd got to the bother of being so clear and so detailed >>>>>> to describe something that you think is impossible. >>>>> >>>>> What I described is how Halts() correctly decides halting on H_Hat(). >>>> >>>> Backpedalling, incompetence or lying -- I am not sure which yet. >>> >>> I am not going to bother to read all that... >> >> That's up to you. >> >> Since you won't answer my questions I shall state what I see. You used >> the clarity of Turing machines to explain what your Halts function is >> doing: >> >> (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. > > When a TM correctly decides to stop simulating its input because this > input would never otherwise halt this TM has correctly decided not > halting on this input. I am asking about (a) to (g) which are clear. If you say that that ghastly sentence means that same as (a) to (g) then so be it. > ∀x ∈ Turing_Machine_Descriptions Must_be_Stopped(x) ≡ ¬Halting(x) (e) is clear; there is no need for More_Magic_Names. An F that "can infallibly detect that an input pair specifies infinite execution" is a halt decider in all but name. > In other words when the above English criteria is met then (e) is > fully satisfied. >> (g) At the point where F infallibly detects the infinite execution of >> its input pair F decides to stop simulating its input. >> > This is a halt decider in all but name (two transitions, one to an >> accepting state and one to a rejecting state are all that need be added >> to f to make it one), so I asked if you believed that such an F exists, >> or if in fact you claim to actually have such an F. > > I believe that I have the beginning basis for solving the halting > problem. Is this an answer? Sort of. I'll take it as the best I'll get: you think such a F exists, but you don't claim to have such an F. Is that about it? But why did it take so long to get to even this not-quite-answer? > It cracks the door open by showing how a Sipser TM H can > correctly decide a Sipser TM D. No. Nothing in (a) to (g) suggests that Sipser (or Turing or Church or Post or Kleene or Mendelson or Linz or...) are wrong. Nothing in (a) to (g) suggests that such an F can exist. It's just a specification. It's just a specification that every TM fails to meet. The best you have so far is a function that you tell me returns false for a finite computation, which you declare to be the PO-correct answer because it is the (actual) correct answer for a related computation. Sipser is sleeping easy tonight. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-24 21:16 -0500 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <yoKdnVIrD7FvTRn9nZ2dnUU7-QPNnZ2d@giganews.com> |
| In reply to | #32051 |
On 4/23/2021 8:34 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 4/23/2021 7:27 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>> On 4/22/2021 8:37 PM, Ben Bacarisse wrote:
>>>
>>>>> Please answer my questions. You carefully describe an F that looks very
>>>>> much like the code you've been talking about for months. Do you believe
>>>>> that such a TM exists?
>>>>>
>>>>> I can't see why you'd got to the bother of being so clear and so detailed
>>>>> to describe something that you think is impossible.
>>>>
>>>> What I described is how Halts() correctly decides halting on H_Hat().
>>>
>>> Backpedalling, incompetence or lying -- I am not sure which yet.
>>
>> I am not going to bother to read all that...
>
> That's up to you.
>
> Since you won't answer my questions I shall state what I see. You used
> the clarity of Turing machines to explain what your Halts function is
> doing:
>
I AM ADDING THE PROPER ATTRIBUTION
On 4/22/2021 9:33 AM, olcott wrote:
> 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.
> (f) At the point where F infallibly detects the infinite execution of
> its input pair F decides to stop simulating its input.
My whole purpose of providing all of the above detailed background was
to set up this single point:
In all the cases where this criteria is met then the above (e) is met:
When a TM correctly decides to stop simulating its input because this
input would never otherwise halt this TM has correctly decided not
halting on this input.
∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x))
If my partial halt decider only correctly decides that a single input x
Must_be_Stopped(x) then this input is necessarily ¬Halting(x)
These three cases are: Must_be_Stopped(x)
void Infinite_Loop()
{
HERE: goto HERE;
}
void Infinite_Recursion(u32 N)
{
Infinite_Recursion(N);
}
void H_Hat(u32 P)
{
u32 Input_Halts = Halts(P, P);
if (Input_Halts)
HERE: goto HERE;
}
int main()
{
u32 Input1_Would_Halt = Halts((u32)Infinite_Loop, (u32)Infinite_Loop);
u32 Input2_Would_Halt = Halts((u32)Infinite_Recursion, 1);
u32 Input3_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
}
--
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-25 14:06 +0100 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <871rayjyye.fsf@bsb.me.uk> |
| In reply to | #32128 |
olcott <NoOne@NoWhere.com> writes: > I AM ADDING THE PROPER ATTRIBUTION > > On 4/22/2021 9:33 AM, olcott wrote: >> 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. >> (f) At the point where F infallibly detects the infinite execution of >> its input pair F decides to stop simulating its input. In what sense is this the proper attribution? It appears to be a misquote. The original post had no (f). Are you referring to Message-ID: <readncmm2oqnFBz9nZ2dnUU7-UXNnZ2d@giganews.com>? > My whole purpose of providing all of the above detailed background was > to set up this single point: > > In all the cases where this criteria is met then the above (e) is met: > > When a TM correctly decides to stop simulating its input because this > input would never otherwise halt this TM has correctly decided not > halting on this input. (e) is not something that can be met. Do you mean that that awful sentence just means that you can sometime detect an input the denotes a non-halting computation? If that's what you mean, fine. > ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x)) I do look forward to these little poems. I wonder what this one means. Is it a definition of Must_be_Stopped? It looks like one. > If my partial halt decider only correctly decides that a single input > x Must_be_Stopped(x) then this input is necessarily ¬Halting(x) Then you should not use a universal quantifier, or make other universal claims. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-04-25 09:15 -0500 |
| Subject | Re: Infinite recursion detection criteria: (formalized) |
| Message-ID | <1YidneAakpfp5Bj9nZ2dnUU7-Q3NnZ2d@giganews.com> |
| In reply to | #32140 |
On 4/25/2021 8:06 AM, Ben Bacarisse wrote: > olcott <NoOne@NoWhere.com> writes: > >> I AM ADDING THE PROPER ATTRIBUTION >> >> On 4/22/2021 9:33 AM, olcott wrote: >>> 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. >>> (f) At the point where F infallibly detects the infinite execution of >>> its input pair F decides to stop simulating its input. > > In what sense is this the proper attribution? It appears to be a > misquote. The original post had no (f). Are you referring to > Message-ID: <readncmm2oqnFBz9nZ2dnUU7-UXNnZ2d@giganews.com>? > >> My whole purpose of providing all of the above detailed background was >> to set up this single point: >> >> In all the cases where this criteria is met then the above (e) is met: >> >> When a TM correctly decides to stop simulating its input because this >> input would never otherwise halt this TM has correctly decided not >> halting on this input. > > (e) is not something that can be met. Do you mean that that awful > sentence just means that you can sometime detect an input the denotes a > non-halting computation? If that's what you mean, fine. > >> ∀x ∈ Turing_Machine_Descriptions (Must_be_Stopped(x) ≡ ¬Halting(x)) > > I do look forward to these little poems. I wonder what this one means. > Is it a definition of Must_be_Stopped? It looks like one. > >> If my partial halt decider only correctly decides that a single input >> x Must_be_Stopped(x) then this input is necessarily ¬Halting(x) > > Then you should not use a universal quantifier, or make other universal > claims. > The universal quantifier is correct in that every (Must_be_Stopped(x) ≡ ¬Halting(x)) We cannot move on to the next point until after you understand this point. -- Copyright 2021 Pete Olcott "Great spirits have always encountered violent opposition from mediocre minds." Einstein
[toc] | [prev] | [next] | [standalone]
Page 4 of 8 — ← Prev page 1 2 3 [4] 5 6 7 8 Next page →
Back to top | Article view | comp.theory
csiph-web