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 21:23:31 +0200
Organization: albasani.net
Lines: 11
Message-ID: <h454jj$pol$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> 	<h44pe7$8po$1@news.albasani.net> <c2df7d4b-8b46-486d-af56-c295af6d7719@r2g2000yqm.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 iqLvmF/uRehxgHjea2irUxha1s7px9+gW6LlNlxgA/I9nqJ6TRDeibzA/+eg7kNIA0pZNaOcOP9RAve/1/Z3g34rKubYf8ksDpCWab1Wqegu971k85itspBlb8319As5
X-Complaints-To: abuse@albasani.net
NNTP-Posting-Date: Tue, 21 Jul 2009 19:23:31 +0000 (UTC)
X-User-ID: ZAzHg+BZZ9p1u96tqJqkfLN1epcO3f14bek9WaAHsRs=
In-Reply-To: <c2df7d4b-8b46-486d-af56-c295af6d7719@r2g2000yqm.googlegroups.com>
Cancel-Lock: sha1:PvII8stA1SiCK7xAu6qfox6gwlQ=
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: LAxIwTWwiJN0zyWYjZk2ah5k+aQfPBiiNMs1s8zeSbk=
Xref: news.mathworks.com sci.logic:231564 comp.graphics.algorithms:175340 comp.dsp:260134 comp.soft-sys.matlab:557273 comp.compression:100008


LudovicoVan schrieb:
> is no specific connection to algorithms complexity, though.

I gave you an example how a connection could be established.

Could you elaborate a little bit, why you are so sure that
the classical Aristotelan thinking in predicates and classes,
which OO is resemblance of, does not go into algorithmic
complexity?

Best Regards