Re: Deterministic Algorithm for Random Number Generation Using Coin Flips

Assuming you mean black humans by "niggers" I can assure you there are
"niggers" that are much more intelligent than you are. I suppose you are
still one of the few remaining neanderthals left in the world?

Statistically unlikely. Since my intelligence is in the 5-6 s.d. range
(as normed by the Titan and Mega tests), and given the fact that
niggers have a lower variance in IQ than white masters, it's actually
unlikely there is a single *** alive smarter than me. (or ever has
been)

The problem here is you were given exactly the answer to the question you
asked for but because it was not the answer you wanted you here you have to
start to rant and name call. This is definitely a sign of ignorance as well
as arrogance.

No. The White master slave calling started when the jiggaboo stole my
algorithm and passed it off as his own.

It was also a result of him stating the very obvious truth that the
probability of my algorithm terminating in finite steps was 1 when he
knew well what I actually meant.

And as I've stated, if I'd stated the problem differently, such as:
"guaranteed to terminate", you beaners would have deliberately
misinterpreted it in exactly the same manner since that phrasing could
be interpreted in exactly the same way that my original phrasing was.

If you were intelligent enough you might have actually phrased the problem
in a better way so that it was clear what you were after. Such as an
"optimal algorithm" that had the shortest time and if such an algorithm
existed. In this case it would be a good starting point having to do 3 does
not divide 2^n. But because of your mathematical ignorance you cannot see
that your question was properly solved nor how to phrase the real question
you are asking.

And I never wanted an optimal algorithm. I guess you're such a monkey-
brained porch monkey that you didn't realize I wasn't worried about
optimization. All I was looking for was some kind of "deterministic"
algorithm that would terminate in some finite amount of steps
everytime.

Maybe a way to word it unambiguously would be as such:

I want an algorithm that given a binary flatly-distributed generator,
create a trinary flatly-distributed generator that for some integer N,
will always terminate in N flips or less in all cases.

Since you are asking the 'experts'(and I make no claim that I am one) you
should at least attempt to understand their answer before you start name
calling and looking like a fool. At least then you might get help on the
real problem you are after instead of blowing your load too soon.

I understood their useless answers perfectly. They consisted of a
deliberate misinterpretation of a simple and obvious question, copying
my algorithm and passing it off as their own, and general foolery,
ignorance, and stupidity reminiscent of the modern-age niggerbrain.
.

Quantcast