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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,9c86eb13dd395066
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: CRC in Ada?
Date: 1997/03/06
Message-ID: <dewar.857652475@merv>#1/1
X-Deja-AN: 223528449
References: <1997Mar2.220652@nova.wright.edu> <1997Mar5.083233.1@eisner>
 <E6Kxux.FL9@world.std.com> <1997Mar5.131846.1@eisner>
 <E6Lpv3.AoL@world.std.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-03-06T00:00:00+00:00
List-Id: <comp.lang.ada>


Larry Kilgallen <kilgallen@eisner.decus.org> wrote:

<<While theoretical computing and Alan Turing may be centered on
the equivalence and correctness of programs, in the real world
performance is also a consideration.>>

  This shows a big misunderstanding of the theory of correctness. If
  performance is part of the requirement, it must be part of the
  specification, and thus part of the criterion for correctness. This
  is not to say it is easy to prove correctness for such specifications,
  it is indeed hard. But there is a lot of work of value here, which
  I recommend Larry investigate before dismissing it in such a 
  cavalier manner :-)