From: Nikolai Weibull <mailing-lists.ruby-talk@...>
Date: 2005-03-17T09:59:57+09:00
Subject: Re: Fibonacci Benchmark Correction

* jzakiya@mail.com (Mar 17, 2005 01:30):
> Would an algorithm that produces the factorial 0!=0 (and not 0!=1) be
> considered to be a correct factorial algorithm? I don't think so.

Well, it's only "by convention" really.  You could define 0! = 0 if you
so wished.  It wouldn't make much sense, but you could.

> What is really dangerous is someone using the coded algorithms
> thinking that for a given index N the computed fibonacci F(N) value is
> correct.

Eh, since when did the GLS become authoritative on algorithm
implementation?

> This is not about the given code being a valid representation for some
> arbitrary benchmark, but about the misrepresentation of that code as
> producing the correct results for the fibonacce series, a fundamental
> mathematical algorithm that is used in many fields of math and
> science.

Worthy of a crusade?,
	nikolai


-- 
::: name: Nikolai Weibull    :: aliases: pcp / lone-star / aka :::
::: born: Chicago, IL USA    :: loc atm: Gothenburg, Sweden    :::
::: page: www.pcppopper.org  :: fun atm: gf,lps,ruby,lisp,war3 :::
main(){printf(&linux["\021%six\012\0"],(linux)["have"]+"fun"-97);}