[過去ﾛｸﾞ] 現代数学の系譜　カントル　超限集合論2 (1002ﾚｽ)
上下前次1-新
抽出解除 ﾚｽ栞

---

このｽﾚｯﾄﾞは過去ﾛｸﾞ倉庫に格納されています｡
次ｽﾚ検索 歴削→次ｽﾚ 栞削→次ｽﾚ 過去ﾛｸﾞﾒﾆｭｰ

---

ﾘﾛｰﾄﾞ規制です｡10分ほどで解除するので､他のﾌﾞﾗｳｻﾞへ避難してください｡

---

587(1): 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE 2020/03/22(日)09:53 ID:TMbOZsnt(4/22) AAS
>>586
つづき

4)What we have then is this: For each fixed opponent strategy, if i is chosen uniformly independently of that strategy (where the "independently" here isn't in the probabilistic sense), we win with probability at least (n?1)/n.
That's right. But now the question is whether we can translate this to a statement without the conditional "For each fixed opponent strategy". ? Alexander Pruss Dec 19 '13 at 15:05
5)How about describing the riddle as this game, where we have to first explicit our strategy, then an opponent can choose any sequence. then it is obvious than our strategy cannot depend on the sequence. The riddle is "find how to win this game with proba (n-1)/n, for any n." ? Denis Dec 19 '13 at 19:43
6)But the opponent can win by foreseeing what which value of i we're going to choose and which choice of representatives we'll make. I suppose we would ban foresight of i? ? Alexander Pruss Dec 19 '13 at 21:25
7)yes the order would be: 1)describe the probabilistic strategy 2)opponent choses a sequence 3)probabilistic variable i is instanciated ? Denis Dec 19 '13 at 23:02
省1

---

592: 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE 2020/03/22(日)11:13 ID:TMbOZsnt(9/22) AAS
>>586-587
まとめ

数学DRにして大学教授（数理哲学）のPruss氏の回答に対して
質問者 Denis氏 （コンピュータサイエンス）は、確率の測度論に入っていけない
”but for this we only need the uniform distribution on {0,…,n}”の一点ばり

対して Pruss氏は、確率の独立概念の哲学文献などを示して、説得しようとするが、理解できないDenis氏
圧倒的に、Pruss氏の数学レベルが高い
省14

---

上下前次1-新書関写板覧索設栞歴

---

ｽﾚ情報 赤ﾚｽ抽出 画像ﾚｽ抽出 歴の未読ｽﾚ AAｻﾑﾈｲﾙ

---

ぬこの手 ぬこTOP 0.041s