現代数学の系譜工学物理雑談古典ガロア理論も読む75

[過去ﾛｸﾞ] 現代数学の系譜工学物理雑談古典ガロア理論も読む75 (1002ﾚｽ)
上下前次1-新
通常表示 512ﾊﾞｲﾄ分割ﾚｽ栞
抽出解除ﾚｽ栞

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

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

703: 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE  [sage] 2019/08/23(金) 17:36:11.91 ID:1bhuzzzJ

>>702
つづき

However, in a recent work, "Solving the hard problem of Bertrand's paradox",[10] Diederik Aerts and Massimiliano Sassoli de Bianchi consider that a mixed strategy is necessary to tackle Bertrand's paradox.
According to these authors, the problem needs first to be disambiguated by specifying in a very clear way the nature of the entity which is subjected to the randomization, and only once this is done the problem can be considered to be a well-posed one, in the Jaynes sense, so that the principle of maximum ignorance can be used to solve it.
To this end, and since the problem doesn't specify how the chord has to be selected, the principle needs to be applied not at the level of the different possible choices of a chord, but at the much deeper level of the different possible ways of choosing a chord.
This requires the calculation of a meta average over all the possible ways of selecting a chord, which the authors call a universal average. To handle it, they use a discretization method inspired by what is done in the definition of the probability law in the Wiener processes.
The result they obtain is in agreement with the numerical result of Jaynes, although their well-posed problem is different from that of Jaynes.
(引用終り)
以上

http://rio2016.5ch.net/test/read.cgi/math/1565872684/703

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

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

ぬこの手ぬこTOP 0.046s