Viewing profile — EbTech
EbTech
HN member- Joined
- Thu, Feb 19, 2015, 6:06 AM UTC
- HN karma
- 255
- Public activity
- 21 items
- HN profile
- View on Hacker News ↗
About EbTech
Recent public activity
- story
-
comment
Comment #26144084
There's a link to the repo with our own rating system package. Maybe I should have shown that directly? The intention was to specifically draw attention to this finding.
- story
-
comment
Comment #25258781
The reference by Rathmanner & Hutter presents a useful analogy. It argues that Kolmogorov complexity (and Solomonoff induction) are best viewed as a conceptual gold standard, like …
-
comment
Comment #25243029
Thanks for the detailed critique! I'll take some time to think about how to better make the points that I wanted to convey with those sections.
-
comment
Comment #25242988
Thanks! I hope to better address your concerns in Part 2.
-
comment
Comment #25242968
Hm I admit it's hard to talk convincingly about election prediction, since we don't have practical algorithms to do this; a lot of it comes down to human judgment. The philosophica…
-
comment
Comment #25242942
1) I rather like the subjective view! Bayesians used to struggle to justify a choice of prior, but it turns out that 2^-K(x) is universal in the sense that it never falls below a c…
-
comment
Comment #25242893
Thanks. I should clarify that the computer is deterministic, so as to avoid building randomness into the definition of randomness! I skimmed over an example too quickly, but your i…
-
comment
Comment #25242861
Thanks! :) I wasn't planning to go there! While I enjoy the idea, for now I'm trying to focus on what's needed to make sense of the problem of induction. Is there a nice connection…
-
comment
Comment #25242847
I don't think frequentism is "bad"; just insufficient as a gold standard interpretation of probabilistic claims. I liked an analogy from the reference by Rathmanner & Hutter: the m…
-
comment
Comment #25241477
The compression code can be specified first. If you have a lot of data, the specification will be negligible in length, compared to the code itself. Together, the specification and…
-
comment
Comment #25240824
Fair enough! I'd like to point out that the Kolmogorov complexity approach can make sense of subjective probability too. Since you lack precise enough information to predict the di…
-
comment
Comment #25237357
Since this topic isn't so well-known, I wrote the case arguing that frequentist interpretations don't work, but algorithmic information theory (Kolmogorov complexity) does. I want …
- story
- story
-
comment
Comment #14591543
Suggestions are welcome; I'm still learning Rust. To put context around my provocative comment earlier: I write C++ professionally. C++ is the right choice for my organization, tho…
-
comment
Comment #14590348
I made this cookbook specifically to show it doesn't have to be so hard. While designing an industrial-strength data structure library is an advanced skill, there are easier ways t…
-
comment
Comment #14590300
What's their philosophy? I think Petr was using C# at some point.
-
comment
Comment #14590029
Fair point, it's fixed now.
- story