Re: Abstract Algorithms

New Message Reply About this list Date view Thread view Subject view Author view

David Honig (honig@m7.sprynet.com)
Wed, 29 Jul 1998 10:39:35 -0700


At 08:38 PM 7/28/98 +0100, Ben Laurie wrote:
>Suppose the transformation just happened to be reversible...
>
>int f(int a,int b)
> {
> return a+b;
> }
>
>...
>
>In order to calculate the function f, which returns an int, and takes
>two arguments a, an int, and b, an int, return the result of adding a to
>b.
>

In o'da' to calculate da damn funcshun f, which returns an int, and
snatch'd two arguments a, an int, and b, an int, return de result uh addin'
some to b. Sheeeiit.

In order to calculate thuh function f, fer shure, which returns an int,
man, and takes two arguments a, like, an int, like, wow, and b, like, an
int, like, return thuh result of addin' a to b.

Etc. etc.

honig@alum.mit.edu

   "Speech is not protected simply because it is written in a language"
        Federal Misjudge Gwin on the Bernstein Case


New Message Reply About this list Date view Thread view Subject view Author view

 
All trademarks and copyrights are the property of their respective owners.

Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:21:01 ADT