|Perl: the Markov chain saw|
Re^9: Hockey Sticksby BrowserUk (Pope)
|on Jul 11, 2012 at 05:13 UTC||Need Help??|
routinely attracts trolls
I won't ask you to define troll in this instance, but I do have a question.
Has anyone performed even rudimentary benchmarking of the various implementations of P6?
I'm still attracted to (what I remember of) the P6 syntax, but for the type of applications I mostly write -- generally cpu-bound -- cool syntax isn't sufficient justification for taking a 10x or even 5x performance hit over P5.
A simple benchmark -- as a minimalistic start I'd suggest: a) a non-trick, non-caching implementation of Ackermann; b) Stirling's series; c) the string handling benchmark from here; -- would give a somewhat real-world measurement of how the implementations are progressing from that point of view against P5, each other, and against themselves over time.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.