Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai.philosophy    |    Perhaps we should ask SkyNet about this    |    59,235 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 57,651 of 59,235    |
|    olcott to Fred. Zwarts    |
|    Re: Title: A Structural Analysis of the     |
|    25 Jul 25 11:44:23    |
      XPost: comp.theory, sci.logic       From: polcott333@gmail.com              On 7/25/2025 3:49 AM, Fred. Zwarts wrote:       > Op 23.jul.2025 om 15:31 schreef olcott:       >> On 7/23/2025 3:24 AM, Fred. Zwarts wrote:       >>> Op 23.jul.2025 om 06:05 schreef olcott:       >>>> On 7/22/2025 9:32 PM, Richard Damon wrote:       >>>>>       >>>>> No, YOU changed the subject of the problem from the OBJECTIVE       >>>>> behavior of the execution of DDD, to the SUBJECTIVE criteria of       >>>>> what HHH sees.       >>>>>       >>       >> It is always the case that every halt decider is       >> only accountable for the behavior that its actual       >> input specifies and not accountable for the behavior       >> of any non-inputs. The textbooks don't do it this       >> way proves that textbooks are wrong.       >       > As usual irrelevant claim without evidence       > Up to now you could not point to any textbook that is wrong.       >       >>       >> Textbooks incorrectly assume that the behavior specified       >> by the finite string machine description of ⟨M⟩ is always       >> the same as the behavior of machine M. That is not the       >> case when M calls its own termination analyzer.       >       > As usual repeated claims without any evidence.       > The behaviour specified in the description of the input does not depend       > on who analyses it. When some analysers are unable to see the whole       > specification, that is an error in the analyser, it does not change the       > specification.       >       >>       >> Turing machine halt deciders compute the mapping from       >> their input finite strings to the behavior that these       >> finite strings specify.       >       > Exactly.       > And when a halting behaviour is specified, but the analyser is unable to       > see that, the analyser is wrong. It should not compute the behaviour of       > a hypothetical non-halting non-input.       >       >>       >>>>       >>>> *Its been three years now and you can't remember*       >>>> |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca