Talk:Las Vegas algorithm: Difference between revisions

Revision as of 07:36, 23 September 2008

Revision as of 04:43, 6 December 2010

Line 16:

BTW, the NIST definition agrees a little more with "gambling with resources" in that for each run, <em>for the same problem instance</em>, the runtime resource requirements (time/space/etc) will possibly be different. But all programs, etc "gamble with resources", always assuming that there will be enough resources to solve any particular problem instance (and sometimes failing). So I agree, probably ought to consider better wording. [[User:Root4(one)|Root4(one)]] 04:58, 12 January 2007 (UTC)

== Want more examples ==

I should like to see more examples of Las Vegas algorithms. For instance, is [[bogosort]] a Las Vegas algorithm? Bogosort is very random but is supposed to ''eventually'' give the right solution. Right now, there is only one example of a Las Vegas algorithm in the article, and it isn't even particularly well-explained. I'm sure that adding more examples will make this article far more accessible to laymen. [[User:Purpy Pupple|Purpy Pupple]] ([[User talk:Purpy Pupple|talk]]) 04:43, 6 December 2010 (UTC)