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 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Heartbleed Date: Tue, 15 Apr 2014 14:35:21 +0200 Organization: cbb software GmbH Message-ID: References: <1ljwj8f.1wqbhvuabsdw1N%csampson@inetworld.net> <51c7d6d4-e3be-44d5-a4ce-f7e875345588@googlegroups.com> <%J32v.70539$kp1.45343@fx14.iad> <87mwfq4vvj.fsf@kuiper.lan.informatimago.com> <87ioqe4brz.fsf@kuiper.lan.informatimago.com> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: G+aXx1XI67D34t54ibhUPQ.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="utf-8" Content-Transfer-Encoding: 8bit X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:19310 Date: 2014-04-15T14:35:21+02:00 List-Id: On Tue, 15 Apr 2014 12:02:24 +0200, Yannick Duchêne (Hibou57) wrote: > Le Sat, 12 Apr 2014 22:34:49 +0200, Dmitry A. Kazakov > a écrit: >> It is a common delusion that mathematically correct results are correct >> when dealing with a physical system. > > Here is a related quote, from “Is computer science a branch of > mathematics?” > http://math.stackexchange.com/questions/649408/is-computer-science-a-branch-of-mathematics/649526#649526 >>It is not uncommon to hear ideas along the lines that >> * Computer science is computer programming without practical >> constraints I would say CS is science without programming. >> * Theoretical computer science is computer science without physical >> constraints A science without engineering. >> * Mathematics is computer science without finiteness constraints No. There is discrete mathematics, number theory, groups, linear programming and optimization problems which are all about constraints. Functional analysis (real numbers) and Peano arithmetic (integers) are infinite => incomputable. --------------------- BTW, there would be no problem to use a bignum library in Ada, if that were useful. But for automation and control bignum is of little use, because it would be a source of additional errors, such as violation of range, accuracy, time, space constraints, such systems typically have. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de