Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Languages revisited. Functional language beats C for number cruncing

Author: Joel

Date: 18:19:35 01/10/03

Go up one level in this thread


Hello Dan,

I have written a reasonable amount of Haskell in my time, so functional
languages are not foreign to me.

Could you please explain this interesting statement?

"And the number of bugs tend to be linear to the length of the program."

The idea of speaking about the complexity of a program is new to me.

Is the reason you make this statement because when you write a new function
(generally only a few lines), it usually interacts with functions you have
previously defined, as opposed to say in a assembly language program, each new
statement you write has the potential to break a large portion of what you have
done before, so you could very very roughly say the number of bugs would be
quadratic to the length of the assembly program?



Joel




This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.