News for hackers. Stuff that matters.
Re:A Las Vegas algorithm to solve the elliptic curve discret... by teraflop on Monday April 03, 2017 @12:28PM (#14024194)
It's not just an Americanization. "Las Vegas" and "Monte Carlo" are technical terms with specific, different meanings.

A Monte Carlo algorithm runs in a deterministic amount of time, and computes a probabilistic (approximate) result. For example: Monte Carlo numerical integration, or Miller-Rabin primality testing.

A Las Vegas algorithm takes a non-deterministic amount of time, but is guaranteed to return a correct result. For example: quicksort with a random choice of pivot.

Re:A Las Vegas algorithm to solve the elliptic curve discret... by rawnlq on Monday April 03, 2017 @04:19PM (#14026754)
There's a popular interview question that has a las vegas algorithm as a solution. It's a more illustrative example since it takes an unbounded amount of time.

Let's say you want to simulate a 1/3-biased coin with a fair coin.

One solution is to flip the fair coin twice, then output heads if you get HH, output tails if you get TH or HT, otherwise retry (if TT).

Then this process is guaranteed to always output heads with 1/3 probability and tails with 2/3 probability if it ever ends. The runtime complexity is unbounded since you can keep getting TT forever but the expected runtime is constant.

Re:A Las Vegas algorithm to solve the elliptic curve discret... by curuinor on Monday April 03, 2017 @05:33PM (#14027389)
Similary to St. Petersburg paradox (https://en.wikipedia.org/wiki/St._Petersburg_paradox).

The expectation is a stranger and more dangerous beast than would be easily expected.

Re:A Las Vegas algorithm to solve the elliptic curve discret... by tgb on Monday April 03, 2017 @12:42PM (#14024372)
I don't see why quick sort with a random pivot takes a non deterministic amount of time.
Re:A Las Vegas algorithm to solve the elliptic curve discret... by rdtsc on Monday April 03, 2017 @12:48PM (#14024450)
> I don't see why quick sort with a random pivot takes a non deterministic amount of time.

Because it might sort faster or slower depending on how the pivot gets picked. But you'd get the sorted list in the end. A Monte Carlo solution might run for 5 seconds but you might get a partially sorted list only.

Re:A Las Vegas algorithm to solve the elliptic curve discret... by tgb on Monday April 03, 2017 @01:21PM (#14024887)
Ah I see thanks. I was thinking the claim was that it might take an unbounded amount of time.