In the section about Non-Dogmatism , I believe something was switched around. It says that if the logical inductor assigns prices converging to $1 to a proposition that cannot be proven, that the trader can buy shares in that proposition at prices of $2−n and thereby gain infinite potential upside. I believe this should say that if the logical inductor assigns prices converging to $0 to a proposition that can’t be dis-proven, instead of prices converging to $1 for a proposition that can’t be proven . (I think that if the price was converging to $1 for a proposition that cannot be proven, the trader would sell 1/(1−cn) shares at prices $1−cn , for potential gain of $1 each time, and potential losses of (1/(1−cn))−1 , so, to have this be $2−n , this should be 1−cn=(1/(1+2−n) .)
There’s also a little formatting error with the LaTeX in section 4.1
Nice summary/guide! It made the idea behind the construction of the algorithm much more clear to me. (I had a decent understanding of the criterion, but I hadn’t really understood big picture of the algorithm. I think I had previously been tripped up by the details around the continuity and such, and not following these led to me not getting the big picture of it.)
In the section about Non-Dogmatism , I believe something was switched around. It says that if the logical inductor assigns prices converging to $1 to a proposition that cannot be proven, that the trader can buy shares in that proposition at prices of $2−n and thereby gain infinite potential upside. I believe this should say that if the logical inductor assigns prices converging to $0 to a proposition that can’t be dis-proven, instead of prices converging to $1 for a proposition that can’t be proven .
(I think that if the price was converging to $1 for a proposition that cannot be proven, the trader would sell 1/(1−cn) shares at prices $1−cn , for potential gain of $1 each time, and potential losses of (1/(1−cn))−1 , so, to have this be $2−n , this should be 1−cn=(1/(1+2−n) .)
There’s also a little formatting error with the LaTeX in section 4.1
Nice summary/guide! It made the idea behind the construction of the algorithm much more clear to me.
(I had a decent understanding of the criterion, but I hadn’t really understood big picture of the algorithm. I think I had previously been tripped up by the details around the continuity and such, and not following these led to me not getting the big picture of it.)
Thanks! Should be fixed now.