From: Bill Stewart <bill.stewart@pobox.com>
To: Hua@teralogic-inc.com>
Message Hash: 5bd2836ede13a195296a5bca44137ebd113e41e21eaac05415b0cacfbf4c79bf
Message ID: <3.0.5.32.19980710171121.008f33f0@popd.ix.netcom.com>
Reply To: <413AC08141DBD011A58000A0C924A6D52C359A@mvs2.teralogic-inc.com>
UTC Datetime: 1998-07-11 04:14:19 UTC
Raw Date: Fri, 10 Jul 1998 21:14:19 -0700 (PDT)
From: Bill Stewart <bill.stewart@pobox.com>
Date: Fri, 10 Jul 1998 21:14:19 -0700 (PDT)
To: Hua@teralogic-inc.com>
Subject: RE: Junger et al.
In-Reply-To: <413AC08141DBD011A58000A0C924A6D52C359A@mvs2.teralogic-inc.com>
Message-ID: <3.0.5.32.19980710171121.008f33f0@popd.ix.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain
At 03:11 AM 7/7/98 -0400, mgraffam@mhv.net wrote:
>On Mon, 6 Jul 1998, Ernest Hua wrote:
>> Did anyone demonstrate the "functionalness" of any arbitrary language
>> via a scanner and a compiler?
>Indeed.. what we need is for someone to testify to the court about
>natural and computer language, and maybe some relevent material from
>information theory.
>
>Pseudo-code from any computer programming textbook would be helpful
>in making this point too.
>
>What about English in a voice recognition system? In this case, English
>can actually perform functions too, just as C does.
A particularly relevent language is the Algorithmic Language, Algol,
which was designed for mathematicians to describe algorithms to each other,
though it was also designed in a way to support compilers,
such as ALGOL-60.
Thanks!
Bill
Bill Stewart, bill.stewart@pobox.com
PGP Fingerprint D454 E202 CBC8 40BF 3C85 B884 0ABE 4639
Return to July 1998
Return to “Xcott Craver <caj@math.niu.edu>”