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,30a335a9b2bdf7d4 X-Google-Attributes: gid103376,public From: Jon S Anthony Subject: Re: AI, security, just wondering. Date: 1998/11/12 Message-ID: #1/1 X-Deja-AN: 411301633 Distribution: world References: <36484B8C.84EEC61D@interact.net.au> <36484595.1189@ddre.dk> Organization: PSINet Newsgroups: comp.lang.ada Date: 1998-11-12T00:00:00+00:00 List-Id: > Backward-chaining expert system shell > Forward-chaining expert system shell > Frames database > Natural language parser > Augmented Transition Network Parser You can write anything in anything - theoretically. But you would be digging yourself a large hole for no good reason doing this sort of stuff in Ada. For example, you can write a reasonbly featured and quite reasonably efficient Prolog engine in CL in something like 4 or 5 pages of (well structured and layed out) code. An ATN is only about a page or so (for examples of both see Paul Grahm's On Lisp). I'm talking about something that's actually useable and useful - not just a simple toy. As a reasonable estimate, doing the same thing in Ada would be >> 10 times the effort (though maybe not quite 100 times). What's more it wouldn't be much more efficient - if any. -- Jon Anthony Synquiry Technologies, Ltd. Belmont, MA 02478, 617.484.3383 "Nightmares - Ha! The way my life's been going lately, Who'd notice?" -- Londo Mollari