search for: prooves

...I expressed an outrageous opinion at Supercomputing back in November, to wit, that CL is probably the best language suited for today's multicore problems... but I don't have the time to hack one of the current implementations to proove the point. Although, you'll notice that LLVM amply prooves "Greenbaum's hypothesis" (IIRC): inside every sufficiently complex program there is an implmentation of a Lisp interpreter. ;-) -scooter

>> I may sound stupid but can someone tell me that after applying >> optimization sequences randomly whether we can surely say that the >> final output is correct? > > Answering this question is equivalent to solving the Halting Problem. Prooving correctness of a compiler is really an NP problem. This goes for any compiler backend. All you can do is have enough test

Hello, i want to implement a common lisp subset using llvm for fun. This requires the use of a garbage collector. I read the docs, but many things are still unclear to me. 1. how are collectors supposed to find all living objects? there is llvm.gcroot for marking objects on the stack,but how do collectors crawl heap objects? I did not see a way to provide custom mark functions. Are

...e the point. interesting, what makes lisp superior in this area over languages with explicit support for parallell computing (like erlang? or Ada) or languages which may be easier auto parallelized (like haskell because of its functional nature). > Although, you'll notice that LLVM amply prooves "Greenbaum's hypothesis" > (IIRC): inside every sufficiently complex program there is an > implmentation of a Lisp interpreter. Nice statement :)

Hi all. I'm experiencing long connect delays due to password file locking errors. For each connection samba logs the following errors: do_pw_lock: failed to lock SMB passwd file. mod_smbpwd_entry: unable to lock file /usr/local/samba-1.9.18p10/private/smbpasswd In the archives I found some other messages reporting the problem (on May this year), but no solution. Did I

Dear Sebastian and all, This is a Japanese to live in Japan. I have a question. Ogg's window functon is f(x)=sin(1/2*pi*sin^2((x+0.5)/n*pi)) for 0 <= x < n But I cannot understand why this window function satisfys the equation f^2(x)+f^2(x+n/2)=2 which is for MDCT's perfect signal reconstruction. reference: Analysis/Synthesis Filter Bank Design Based on Time Domain Aliasing

Dear R-devel list members, we have developed a package and it works perfect in R 1.9.1 but when we prooved with R-devel we get the next output from the R CMD check: Error in eval(expr, envir, enclos) : couldn't find function "@<-" Execution halted ERROR: installing package indices failed ** Removing '/home/pgomez/genArise.Rcheck/genArise' ERROR Installation failed.

> Prooving correctness of a compiler is really an NP problem. This goes for > any compiler backend. All you can do is have enough test cases. No. To be in NP it would be necessary for a Non-deterministic Polynomial algorithm to exist. There is no such algorithm. The problem is undecidable. It doesn't means that it is impossible to prove the correctness of a compiler. It means that no

thomas weidner wrote: >>The reason why I ask is that I expressed an outrageous opinion at >>Supercomputing back in November, to wit, that CL is probably the best >>language suited for today's multicore problems... but I don't have the >>time to hack one of the current implementations to proove the point. > > > interesting, what makes lisp superior in this

https://bugs.freedesktop.org/show_bug.cgi?id=67215 Priority: medium Bug ID: 67215 Assignee: nouveau at lists.freedesktop.org Summary: UBO access seems to mask address on nouveau Severity: normal Classification: Unclassified OS: Linux (All) Reporter: wickmarkus at web.de Hardware: x86-64 (AMD64)

*Top 10 Buildings of the world <http://mega-structures.blogspot.com/>* <http://mega-structures.blogspot.com/> [image: Top 10 Records] <http://mega-structures.blogspot.com/> World Most Tuff Building Earthquake Proove buildings American Steel Buildings Allied steel building The Star Cooling Tower *Top <http://mega-structures.blogspot.com/> 10

Hi ! I am a lonesome penguin in Siemens Austria fighting my battle against the "mouseschubbsers". I have a specific problem I would like to get assistance form any kind soul: network administration is denying any static dns entries in the domain and does not add a reverse entry on the DNS server for the name resolution of my client linux box. So now it comes. I know there is the

Hi there, Is there some way to configure ipfw to do traffic normalizing ("scrubbing", as in ipf for OpenBSD)? Is there any tool to do it for FreeBSD firewalling? I've heard that ipf was ported on current, anything else? TIA, /Dorin. __________________________________ Do you Yahoo!? Yahoo! Mail SpamGuard - Read only the mail you want. http://antispam.yahoo.com/tools

Hi , you can try using cov2cor(vcov(lm(calorie~height))) to get the correlation matrix of estimated coefficients boltonboy999 wrote: > > Hi everyone, > > This is pretty urgent so if anyone can help that would be great. > > I have a table of information. The categories are weight, height, > calories and skinfold. There are 20 entries. I have had to carry out >

I've tried almost any softphone available on the market with many different PC, soundcard, headphones combinations. None of them prooved production reliable in a call center environment. I've also tested many IP Phones and Gateways. Even the cheapest one supplies much better quality. Is this a fact or am I missing a point. I would certanly prefer a softphone because of cost and

In our experience, the total cost of softphones(money, reduced sound quality and lower reliability) in a large call center environment is actually greater over time than the cost of a channelbank and cheap analog headphones. We've tried 2 softphones, 2 kinds of SIP VOIP hardphones, 2 kinds of SIP analog adapters and we've tried channelbanks over the last 3 years. Right now we are half done

Is there a way to find all roots of a polynomial equation? Lets say x^5+a*x^4+b*x^3+c*x^2+d*x+e=0 how to find its all roots? [[alternative HTML version deleted]]

*Top 10 Buildings of the world<http://www.awpedia.com/newstuff/highest-building/> Tuffest, largest, highest, underwater and underground buildings * <http://www.awpedia.com/newstuff/highest-building/> [image: Top 10 Records] <http://www.awpedia.com/newstuff/highest-building/> World Most Tuff Building Earthquake Proove buildings American Steel Buildings Allied steel building The

On Wed, Jul 19, 2006 at 03:09:44AM +0800, deveshti at comp.nus.edu.sg wrote: > I may sound stupid but can someone tell me that after applying > optimization sequences randomly whether we can surely say that the > final output is correct? Answering this question is equivalent to solving the Halting Problem. > I mean if we apply 12 options in random sequence provided by 'opt'

Scott Michel wrote: > thomas weidner wrote: > >>>The reason why I ask is that I expressed an outrageous opinion at >>>Supercomputing back in November, to wit, that CL is probably the best >>>language suited for today's multicore problems... but I don't have the >>>time to hack one of the current implementations to proove the point. >>