Oh yes Sir, Infinity does occupy my belief system very much, would love the pointers please. Blog post, especially using Clojure, is much appreciated..would be grateful!
A great presentation. Except for the "x = x + 1" comment regarding infinite numbers. That is obviously not the case even for transfinite ordinals: a successor ordinal is always distinct (and greater in the ordinality sense) from the predecessor, i.e., x+1 != x, even for transfinite numbers. If one interprets "=" as a normative equivalence, i.e., that the cardinality of LHS equals the cardinality of RHS, then his comment is true for transfinite numbers within certain bands only.
Ah..frankly, I did not understand your 3rd sentence onwards and am on my way to Wikipedia right now..thanks for pointing me to something I dont know. Also, you have wisdom to bring humility forward, so any perceived snobbishness serves a purpose. Your comment helped me :)
If you are interested in infinity in general, I can give some pointers, and I should create a blog post about it, preferably using Clojure to manipulate such transfinite ordinals :-)
Sucks he didn't actually test how fast Mathematica is for numerics. Using Entropy instead of Dot[y, Log[y]] seems needless (as this is what he is testing matlab and R for ...). Also odd that he is generating different random numbers for R (between 0.1, 1.0, no 0 and 1.0, maybe R can give back 0?)
Awesome presentation. Perfect mix of high level overview, zeroing in on a smaller class of problem and not being snobbish. Really liked it.
Oh yes Sir, Infinity does occupy my belief system very much, would love the pointers please. Blog post, especially using Clojure, is much appreciated..would be grateful!
Great presentation! Found it both thoroughly entertaining and very informative.
A great presentation. Except for the "x = x + 1" comment regarding infinite numbers. That is obviously not the case even for transfinite ordinals: a successor ordinal is always distinct (and greater in the ordinality sense) from the predecessor, i.e., x+1 != x, even for transfinite numbers. If one interprets "=" as a normative equivalence, i.e., that the cardinality of LHS equals the cardinality of RHS, then his comment is true for transfinite numbers within certain bands only.
How to handle zeros in relative entropy? In your example, p=[60 40], q=[100 0], and you compute log(p/q), but there's a divide-by-zero iinm?
Ah..frankly, I did not understand your 3rd sentence onwards and am on my way to Wikipedia right now..thanks for pointing me to something I dont know.
Also, you have wisdom to bring humility forward, so any perceived snobbishness serves a purpose. Your comment helped me :)
Very interesting talk, thanks.
If you are interested in infinity in general, I can give some pointers, and I should create a blog post about it, preferably using Clojure to manipulate such transfinite ordinals :-)
@David. Oops - you got me ! Thanks for the correction.
Sucks he didn't actually test how fast Mathematica is for numerics. Using Entropy instead of Dot[y, Log[y]] seems needless (as this is what he is testing matlab and R for ...). Also odd that he is generating different random numbers for R (between 0.1, 1.0, no 0 and 1.0, maybe R can give back 0?)
Even the comment's are great: clicking "watch later" now....Brain-Food !
Ugh, right after writing my comment I read yours, and am now sorry for exposing a certain snobbishness in my comment :(