From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,93a8020cc980d113 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII Path: g2news1.google.com!news2.google.com!newshub.stanford.edu!newsfeed.berkeley.edu!ucberkeley!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail From: "Dmitry A. Kazakov" Subject: Re: What is wrong with Ada? Newsgroups: comp.lang.ada User-Agent: 40tude_Dialog/2.0.15.1 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-7" Content-Transfer-Encoding: 8bit Reply-To: mailbox@dmitry-kazakov.de Organization: cbb software GmbH References: <1176150704.130880.248080@l77g2000hsb.googlegroups.com> <461B52A6.20102@obry.net> <461BA892.3090002@obry.net> <82dgve.spf.ln@hunter.axlog.fr> <1176226291.589741.257600@q75g2000hsh.googlegroups.com> <4eaive.6p9.ln@hunter.axlog.fr> <1rbtw92apxpl1.1ednvo8v6oiq8$.dlg@40tude.net> <13tcswu59l28h.zxb26cabf9a0.dlg@40tude.net> <15k5b4j6za8ag.tpkuccinvzbd.dlg@40tude.net> <1176796706.9578.18.camel@localhost> Date: Tue, 17 Apr 2007 11:27:04 +0200 Message-ID: <109tsryjbjwzz.3mmbgnp1pjjo$.dlg@40tude.net> NNTP-Posting-Date: 17 Apr 2007 11:27:05 CEST NNTP-Posting-Host: bee00311.newsspool3.arcor-online.net X-Trace: DXC=6XU6g^\BH3YB@1;ZJ`1e=GBDNcfSJ;bb[EFCTGGVUmh?DLK[5LiR>kgB`b478M_7\JG X-Complaints-To: usenet-abuse@arcor.de Xref: g2news1.google.com comp.lang.ada:15076 Date: 2007-04-17T11:27:05+02:00 List-Id: On Tue, 17 Apr 2007 09:58:26 +0200, Georg Bauhaus wrote: > On Mon, 2007-04-16 at 11:04 +0200, Markus E Leypold wrote: >> "Dmitry A. Kazakov" writes: > >>> I called it trivial because a valid program processing an infinite input >>> would not require *all* the input to finish. > >> According to your definition all real programs on real >> machines are "trivial". Yes, provided they are correct. (Incorrect programs can be very non-trivial, as everybody having once debugged a program knows... (:-)) > Wouldn't that depend on what "processing" means? Dmitry, > is your program a reactive system (reaching one of its "final" > states when a certain subsequence of input has been read, > reported, and forgotten? Like sensor data, or quadruples of 7 > in the decimal expansion of �)? Sort of. That the input could be forgotten for future processing is a "triviality" condition of processing, program, input language, whatever. (Under certain conditions "processing", "program", "language" are all equivalent.) -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de