hakuseki

8 ms·

61.
by hakuseki 5y ago
The article contains a misleading description of NP-hardness: > Computing the Kolmogorov complexity for a sequence X of N bits length is an NP-hard problem, since the search space of possible programs producing any sequence of length N i
62.
by hakuseki 5y ago
Is NNUE used by any Go AI? I've only heard of it being used for shogi and chess.
63.
by hakuseki 6y ago
Computational complexity seems like a useful frame for thinking about such distinctions. If you can calculate the state of a system at time t in O(log t), that's a lot like having a closed-form solution. On the other hand if the calcul
64.
by hakuseki 6y ago
Actually this is an example of ambiguity, not context sensitivity (in the formal languages sense). Context sensitivity means context is needed to construct a grammatical sentence, not merely to parse one. It's actually pretty hard to
65.
by hakuseki 6y ago
I believe the parent was asking in what sense these models were trained on human data.
66.
by hakuseki 6y ago
> The more important takeaway: dozens of technologists at IBM spent more than three years and untold millions of dollars building the program specifically trained for Jeopardy! prowess. Less than 10 years later, a general-purpose open-so
67.
by hakuseki 6y ago
> It could even be written in a way where the order of arguments didn’t matter Well, 'hello'.join(', ') does not produce the same output as ', '.join('hello'), so the order of the arguments does ma
68.
by hakuseki 6y ago
Yes, you can just `pip install katrain` followed by `python -m katrain` to get started. Personally I would recommend at least reading abut the rules first (unlike MuZero). I think the strength or lack thereof of your opponent is actually mu