EbTech

8 ms·

1.
Why Is the Universe Quantum?(arameb.com)
1 points by EbTech 5y ago|0 comments
2.
by EbTech 6y ago
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.
3.
We Broke Topcoder Ratings (incl. link to Elo-MMR repo)(codeforces.com)
3 points by EbTech 6y ago|3 comments
4.
by EbTech 6y ago
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 a perfect chess computer that does an exhaustive tree se
5.
by EbTech 6y ago
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.
6.
by EbTech 6y ago
Thanks! I hope to better address your concerns in Part 2.
7.
by EbTech 6y ago
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 philosophical point (which might be approximated algorithmical
8.
by EbTech 6y ago
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 constant factor of any given (semi-)computable finite (semi
9.
by EbTech 6y ago
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 intuition is about right. For that sequence, two possible pro
10.
by EbTech 6y ago
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 that I missed?
11.
by EbTech 6y ago
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 most "correct" chess-playing pro
12.
by EbTech 6y ago
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 the Shannon code give an upper bound on the Kolmogorov comp
13.
by EbTech 6y ago
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 dice roll, the most compressed way to write down your obs
14.
Is Probability Real?(arameb.com)
220 points by EbTech 6y ago|218 comments
15.
by EbTech 6y ago
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 to make this accessible and persuasive, so thought
16.
Colors: an exercise in reverse engineering your education(arameb.com)
1 points by EbTech 9y ago|0 comments
17.
by EbTech 9y ago
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, though for purely historical reasons. In the long run, I t
18.
by EbTech 9y ago
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 to implement the core ideas that should suffice for cont
19.
by EbTech 9y ago
What's their philosophy? I think Petr was using C# at some point.
20.
by EbTech 9y ago
Fair point, it's fixed now.
21.
Show HN: Algorithm Cookbook in Rust(github.com)
320 points by EbTech 9y ago|71 comments