Apollonius wrote:Surlethe wrote:A uniform probability distribution is the probability density that corresponds to a constant probability.
I'm not sure I understand this. After 2 minutes of gazing at that sentence, I think it means that every.. uh.. thing that is possible, is equally so (the graph would be a straight line, while non-uniform would be bell-shaped for example). Is that right?
Yes, you're getting the idea. Let me put you on a little more solid ground. Suppose you had a lump of clay, weighing, say, 1 kg. Also, say you had a yardstick, and you must spread the 1 kg of clay along the yardstick any way you want, provided that the entire lump of clay must fit on the yardstick, and the clay must have identical height across the narrow dimension of the yardstick. The amount of clay between two arbitrary tickmarks is directly proportional to the probability of a random variable dictated by that distribution to land between those two values.
A uniform distribution would, between any two tickmarks of the yardstick, have clay equal height across the long dimension of the yardstick, like a block. Non-uniform is any other shape.
Apollonius wrote: A countable infinite set is one that you can index with natural numbers
...so far I'm still following you. So "countable" does just mean we can
start counting them, it doesn't mean we have to walk the entire line. Right?
Not quite. You can start counting an uncountable set, but you'll never be able to finish, just like in the countable case. Two finite set are the same size if you can attach strings between members of the two sets such that each member of one set has
exactly one string that ties it to a unique member of the other set, and vice versa. We can extend this idea to countable infinities by imagining a schema that ties a string from one member to the other in the same way. If we can do it, the two infinite sets are the same size. If one has left-over members, then that set is bigger (just like in the finite case). The schema that ties each member of one set to a unique member of the other set is a one-to-one correspondence, or bijection.
In this language, a countable infinity is one that has at least one bijection with the natural numbers... that is, for each member of the set, there is one and only one natural number it corresponds with, with no left-over natural numbers. By this, the even numbers are a countable infinity, the correspondance being dividing the even number by 2:
{2,4,6,8...} ⇄ {1,2,3,4...}
Apollonius wrote:But there are infinite sets that are so much bigger you can't even list them
Eh? Why not? For lack of what? Because we can't define them or don't know what they are? But if so, how do we know they are infinite or even exist?
No, the proofs of uncountability are immune to such little details. The proof involves assuming that you can list the set in some manner, then arriving at a contradiction. Basically, you use an arbitrary list, undefined in its details, and use that list to construct of a member that is unambiguously NOT on that list. This gives you a contradiction (the listing is supposedly complete, yet we found a member not on the list), and therefore the original premise that we can make such a list is wrong.
Darth Wong on Strollers vs. Assholes: "There were days when I wished that my stroller had weapons on it."
wilfulton on Bible genetics: "If two screaming lunatics copulate in front of another screaming lunatic, the result will be yet another screaming lunatic.

"
SirNitram: "The nation of France is a theory, not a fact. It should therefore be approached with an open mind, and critically debated and considered."
Cornivore! |
BAN-WATCH CANE: XVII | WWJDFAKB? - What Would Jesus Do... For a Klondike Bar? | Evil Bayesian Conspiracy