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,640b65cbfbab7216 X-Google-Attributes: gid103376,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news4.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Mon, 14 Apr 2008 20:13:03 +0200 From: Georg Bauhaus Reply-To: rm.tsoh+bauhaus@maps.futureapps.de User-Agent: Thunderbird 2.0.0.12 (Windows/20080213) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Ada.Strings.Bounded References: <47F26C46.3010607@obry.net> <44d88b93-6a90-4c18-8785-2164934ba700@a9g2000prl.googlegroups.com> <47F652F7.9050502@obry.net> <47f7028d$1_6@news.bluewin.ch> <47F749CB.30806@obry.net> <728033b9-52c1-4951-ba22-5067467dad50@b5g2000pri.googlegroups.com> <90d313e2-115b-4998-ad2d-3d0c4d84f841@q24g2000prf.googlegroups.com> In-Reply-To: <90d313e2-115b-4998-ad2d-3d0c4d84f841@q24g2000prf.googlegroups.com> Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Message-ID: <48039eb1$0$629$9b4e6d93@newsspool1.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 14 Apr 2008 20:13:05 CEST NNTP-Posting-Host: b735e676.newsspool1.arcor-online.net X-Trace: DXC=N1=5k`R0XWG@Y=h<_c3PkHic==]BZ:afN4Fo<]lROoRA8kF Eric Hughes wrote: > On Apr 14, 9:11 am, Adam Beneschan wrote: >> Ooops, I must have stumbled into some other newsgroup---I thought I >> was in comp.lang.ada. > > I did say "heresy". But the whole point of that discussion was to > characterize when non-determinism would not break correctness. It might be worth noting that this kind of "correctness" specifically precludes factors that are essential to typical Ada programming: for a program to solve a problem correctly, use of time and storage must stay within specified bounds, too. Is there a definition of "correctness" that includes more than the necessary, static, computer agnostic precondition of "left side of equation equals right side of equation" no matter when and how?