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.8 required=5.0 tests=BAYES_00,INVALID_DATE,
	MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!uwm.edu!cs.utexas.edu!asuvax!noao!arizona!naucse!sbw
From: sbw@naucse.UUCP (Steve Wampler)
Newsgroups: comp.lang.ada
Subject: Re: A self reproducing program in Ada
Message-ID: <1956@naucse.UUCP>
Date: 21 Mar 90 20:05:29 GMT
References: <53671@microsoft.UUCP>
Organization: Northern Arizona University, Flagstaff, AZ
List-Id: <comp.lang.ada>

>From article <53671@microsoft.UUCP>, by jamesth@microsoft.UUCP (James THIELE):
> In article <900319200431.23c00532@SIC.Epfl.CH> madmats%elcgl.epfl.ch@VMA.CC.CMU.EDU (Mats Weber) writes:
>>[146 lines of Ada code deleted]
> I've seen *much* shorter self-reproducing programs in FORTRAN.
> 
> Does this mean FORTRAN is more sophisticated than Ada?

Actually, since you can fit the self-replicating programs for a
lot of languages simultaneously (i.e. join them together) in the
space of this one Ada program, maybe this means that Ada is all these
other languages rolled into one?

Now I know why I like Icon so much.
-- 
	Steve Wampler
	{....!arizona!naucse!sbw}
	{sbw@naucse.cse.nau.edu}