Path: news.mathworks.com!newsfeed-00.mathworks.com!kanaga.switch.ch!switch.ch!ecngs!feeder2.ecngs.de!88.198.40.140.MISMATCH!weretis.net!feeder2.news.weretis.net!news.albasani.net!not-for-mail
From: Jan Burse <janburse@fastmail.fm>
Newsgroups: sci.logic,comp.graphics.algorithms,comp.dsp,comp.soft-sys.matlab,comp.compression
Subject: Re: "Complex Algorithm R&D: Harder Than Many Think" article published
Date: Tue, 21 Jul 2009 18:12:55 +0200
Organization: albasani.net
Lines: 40
Message-ID: <h44pe7$8po$1@news.albasani.net>
References: <8afea0cf-6821-4457-9e5e-f7c073cee38e@l35g2000pra.googlegroups.com> 	<4A65CD22.9080403@gmail.com> <89766b45-df9d-4009-b829-1bb81629f3a2@26g2000yqk.googlegroups.com> 	<h44qgb$pi$1@SonOfMaze.dpo.uab.edu> <5a58e89e-6b7a-4e6b-8b0e-a76a5d4e0478@c29g2000yqd.googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: news.albasani.net TY4dTfBQAvC12hJYdJH2ff2h1poq4BH+Z60KpDVNSs76j85EM0vtI0Mcce98PuE3Wo1bdM44M9t7Q4whNadcS1o9IqqoXoc4PDWQIlf/3NDZhuKrmgpppuAojnMq7lIA
X-Complaints-To: abuse@albasani.net
NNTP-Posting-Date: Tue, 21 Jul 2009 16:12:55 +0000 (UTC)
X-User-ID: n0rnoaVbA+T2vYYOeKKeIfjVONrxVb/f2ftE5K9ljoA=
In-Reply-To: <5a58e89e-6b7a-4e6b-8b0e-a76a5d4e0478@c29g2000yqd.googlegroups.com>
Cancel-Lock: sha1:McDeKvF2ZHQ3ZVcGSa7KX28Lilk=
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.0; de-AT; rv:1.8.1.22) Gecko/20090605 SeaMonkey/1.1.17
X-NNTP-Posting-Host: JpOAyF7IdoSj+n6hW+I7MFfFEMrk4aUMMe/bdSbEcXs=
Xref: news.mathworks.com sci.logic:231552 comp.graphics.algorithms:175335 comp.dsp:260120 comp.soft-sys.matlab:557195 comp.compression:100003


LudovicoVan schrieb:

> Am I missing something?
> 
> -LV

Yes,
Probably you think algorithmic complexity has to do with
FORTRAN LINPACK efficiency.

But look at the following: Define the necessary structure
where euclides GCD algorithm works mathematically, you
end up in some axioms.

This axioms can be interpreted by further adding axioms,
so that you arrive at natural numbers, rationals, polynoms,
etc.. And the abstract GCD algorithm serves these
structures, and complexity results can be lifted.

Now look at it OO:

     class EuklideanRingElement {
        gcd;
        abstract div etc..
     }
     class Rational extends EuklideanRingElement {
        div
     }
     class Polynom extends EuklideanRingElement {
        div
     }

Just a guess how OO could come in... See also:
http://www.amazon.com/dp/1558606793, think they would
miss OO very much, many of the algorithms are based
on frameworks...

But cutting an OO framework is Art.

Bye