Deutsch English Français Italiano |
<v0r3kh$hka$1@news.muc.de> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.mixmin.net!news2.arglkargh.de!news.karotte.org!news.space.net!news.muc.de!.POSTED.news.muc.de!not-for-mail From: Alan Mackenzie <acm@muc.de> Newsgroups: comp.theory Subject: Re: Can D simulated by H terminate normally? Date: Tue, 30 Apr 2024 15:44:17 -0000 (UTC) Organization: muc.de e.V. Message-ID: <v0r3kh$hka$1@news.muc.de> References: <v0k4jc$laej$1@dont-email.me> <v0m29q$166o1$1@dont-email.me> <v0m37e$2gl1e$1@i2pn2.org> <v0m3v5$16k3h$1@dont-email.me> <v0m55t$2gl1f$3@i2pn2.org> <v0m5sn$172p4$1@dont-email.me> <v0oban$1o3b$1@news.muc.de> <v0oce3$1q3aq$4@dont-email.me> <v0oe1b$1o3b$2@news.muc.de> <v0ofl3$1r1mf$1@dont-email.me> <v0oh7g$1o3b$3@news.muc.de> <v0olhv$1sgeo$1@dont-email.me> <v0oobd$1o3b$4@news.muc.de> <v0or07$1tmga$1@dont-email.me> <v0qb59$2bsfc$1@dont-email.me> <v0r242$2hb7o$1@dont-email.me> Injection-Date: Tue, 30 Apr 2024 15:44:17 -0000 (UTC) Injection-Info: news.muc.de; posting-host="news.muc.de:2001:608:1000::2"; logging-data="18058"; mail-complaints-to="news-admin@muc.de" User-Agent: tin/2.6.3-20231224 ("Banff") (FreeBSD/14.0-RELEASE-p5 (amd64)) Bytes: 3296 Lines: 54 olcott <polcott333@gmail.com> wrote: > On 4/30/2024 3:46 AM, Fred. Zwarts wrote: >> Op 29.apr.2024 om 21:04 schreef olcott: [ .... ] >>> The ONLY way that we can determine if any computation is correct is >>> when it meets its specification. When a TM is specified to calculate >>> the sum of a pair of decimal integers and it derives any decimal >>> integer other than 5 from inputs 2,3 then it is incorrect. >> Changing the subject. The question is not whether it is correct, but >> whether it halts. Incorrect programs exist and even those program may >> halt. > I had to address this: > On 4/29/2024 11:17 AM, Alan Mackenzie wrote: >> There is no notion of "correct" in a turing machine. It is either >> running, or has reached a final state. In the TM equivalent of "core >> dump", a final state has most definitely been reached. I would indeed be charmed if you would address it, but you have evaded it, as you have evaded most of the points I made yesterday. Note that I said there is no correctness _IN_ a turing machine. This is independent of whether or not that turing machine is useful for some external purpose. Note also that you wilfully distorted my meaning by trimming. The full context was: >>> Core dump abnormal termination does not count as the program >>> correctly finished its processing. >> There is no notion of "correct" in a turing machine. It is either >> running, or has reached a final state. In the TM equivalent of "core >> dump", a final state has most definitely been reached. Your use of the word "correctly" in "correctly finished its processing" is wrong. A turing machine is either running or it's finished its processing. From the point of view of the tm, there is no "correct" or "incorrect" associated with the latter condition; it's simply reached a final state. You are thus mistaken in believing "abnormal" termination isn't a final state. > -- > Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius > hits a target no one else can see." Arthur Schopenhauer -- Alan Mackenzie (Nuremberg, Germany).