Re: Purely applicative programming?
- From: André Thieme <address.good.until.2005.may.16@xxxxxxxxxxx>
- Date: Sat, 30 Apr 2005 03:49:29 +0200
Arthur Lemmens schrieb:
Christopher C. Stacy wrote:
There's a funny computer program at MIT that generates nonesense writings sort of like that.
The level of the MIT program (http://pdos.csail.mit.edu/scigen/) is high enough that it makes you wonder if they've tried it out on Usenet as well ;-).
It generates pretty nice nonsense graphs too, by the way.
OMG, this is absolutely cool, I am laughing my ass off *lol*
Here, read the introduction of one of my papers:
Many mathematicians would agree that, had it not been for the emulation of linked lists, the construction of red-black trees might never have occurred. In this paper, we show the analysis of Web services that paved the way for the deployment of digitalto- analog converters, which embodies the unproven principles of robotics. Of course, this is not always the case. In order to answer this grand challenge, we investigate how multicast frameworks can be applied to the evaluation of consistent hashing.
Great link, thanks Arthur!
André -- .
- Prev by Date: Re: Lisp/Unix impedance [a programming challenge]
- Next by Date: Re: Purely applicative^Wfunctional programming?
- Previous by thread: What next after 'Practical' ??
- Next by thread: Re: Purely applicative^Wfunctional programming?
- Index(es):