|
|
|
|
|
|
by mhd
5397 days ago
|
|
|
The problem I see with this premise is that for any reasonable language/environment and actual, real-life problem, n will hardly ever be n. Most of the time, your productivity increase p will be equal to a slowdown s multiplied by a factor f. So the big performance for lots of problems is: How large can f get for you? Sometimes you can't really pay the price (e.g. writing 3D engines in tcl), sometimes the money factor m will make more than up for it (i.e. more programmers, more instances on more servers etc.). Never mind the actual size of p. Given the mentioned hodgepodge of dynamic languages, I'd expect it to be pretty small unless your environment isn't up to it, i.e. you have to write modules. Then even hyper-mega-insta-lisptalkscript will be much slower than CPAN. I'd say that even for C/C++ vs. dynlang f will be pretty high, but again, it often doesn't matter that much… |
|
|