現代数学の系譜　カントル　超限集合論2

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

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

587: 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE  [] 2020/03/22(日) 09:53:44.14 ID:TMbOZsnt

>>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

(引用終り)

http://rio2016.5ch.net/test/read.cgi/math/1576852086/587

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

ｽﾚ情報赤ﾚｽ抽出画像ﾚｽ抽出歴の未読ｽﾚ

ぬこの手ぬこTOP 0.035s