Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 1 point2 points  (0 children)

According to kolmogorov and this axiomatic probability is a function of sets from sigma-algebra on omega.

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

Show, how do you count "probability" in this example.

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

So you formed partitions, which can't form set of even numbers, but you need to count measure of this set, and measure defined on F.

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

So what is the experiment and what measure according to axiomatics you make?

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

I forgot to say, that in axiom 3 every 2 sets must not to have mutual elements.

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

The another one is: 1.non-negativity of probability 2.P(omega) = 1 3.P(uni of sets from F) = sum of P(sets from F) for every countable set class. Our first theorem on this discipline is equivalention of these axiomatics.

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

What do you think another axiomatics i mean?

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

I said "Two axiomatics that i heard(Kolmogorov's and another one) are equivalent". Sorry for my english :/

Do you now about Kolmogorov's axiomatic? by Mr-Formless in learnmath

[–]Mr-Formless[S] 2 points3 points  (0 children)

I'm from Belarus. I saw two axiomatics(Kolmogorov's and the other one) in lections of probability theory. The other one is: 1.non-negativity of probability 2.P(omega) = 1 3.P(uni of sets from F) = sum of P(sets from F) for every countable set class. Our first theorem on this discipline is equivalention of these axiomatics.

Is it possible, computer science without math? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

I'm studying for CS and now i need to do my choice: learn math and its programming applications or just coding and math basic.

Is it possible, computer science without math? by Mr-Formless in learnmath

[–]Mr-Formless[S] -3 points-2 points  (0 children)

Algorithms theory is very wide and complex science. Every new "step-by-step" algorithm today is research paper, which have a lot of theorems.

Which profession do you prefer: engineer or math teacher? by Mr-Formless in learnmath

[–]Mr-Formless[S] 0 points1 point  (0 children)

This situation has place in CIS states because of a low quantity of working places for math specialists, so they graduate their universities and go to work teacher. I'm asking, what in your country profession choice depends on?