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,FREEMAIL_FROM, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c42dbf68f5320193 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-05-08 10:45:14 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!info1.fnal.gov!nntp.upenn.edu!msunews!not-for-mail From: "Chad R. Meiners" Newsgroups: comp.lang.ada Subject: Re: Generation of permutations Date: Wed, 8 May 2002 13:39:30 -0400 Organization: Michigan State University Message-ID: References: <3CD9505F.344C13EA@san.rr.com> Reply-To: "Chad R. Meiners" NNTP-Posting-Host: arctic.cse.msu.edu X-Priority: 3 X-MSMail-Priority: Normal X-Newsreader: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 Xref: archiver1.google.com comp.lang.ada:23731 Date: 2002-05-08T13:39:30-04:00 List-Id: "Darren New" wrote in message news:3CD9505F.344C13EA@san.rr.com... > tmoran@acm.org wrote: > 3) Finite computers are uninteresting to theoreticians. :-) Wow, that's news to me! :-) There are models of space and time bound Turing Machines so I would not say that such things are uninteresting.