|Think about Loose Coupling|
Re^2: [OT] Stats problemby BrowserUk (Pope)
|on Feb 26, 2015 at 11:57 UTC||Need Help??|
Now, pick a card...
I wish I had thought of that analogy.
Recouched in terms of that analogy the problem becomes:
Assume the 'standard ordering' of a pack of cards (minus jokers) is A..K of Spades, A..K of Diamonds, A..K of Clubs, A..K of Hearts.
|Shuffle the pack fairly. Now go through the pack and check how many (if any) of the cards end up in their 'standard position'. Repeat many times.
How often after does a card end up in its standard position? What are the odds of a card ending up in its standard position?
Its not quite right because each card can only end up in one position; whereas with memory corruption; a value may (and usually will) be repeated.
Also, all the possible values (cards) will appear; but in memory, it takes 4-bytes to hold the offset of a single byte. But then again, we are only interested in offsets %8...and only half of the values in memory...I'm lost again.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this
In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked