JohnKemeny

21 ms·

421.
by JohnKemeny 3y ago
A neural network is just a bunch of weights. You can always continue modifying the weights as you see fit. A network is never "done" learning.
422.
by JohnKemeny 3y ago
This is the third time. You can use the search field in the bottom of the page. https://hn.algolia.com/?q=https%3A%2F%2Farxiv.org%2Fabs%2F23...
423.
by JohnKemeny 3y ago
What recently happened with me is that we proved an open problem, and while writing it up, we found that the result was claimed in an arxiv paper that never got published anywhere. Their proof was incomplete. This meant that we had to ackno
424.
by JohnKemeny 4y ago
> So if I am concerned with what can be done in polynomial time, then why would I limit myself to Karp reductions? Because under Karp, SAT and UNSAT are widely different problems whereas under Cook, they're not. You can verify SAT i
425.
by JohnKemeny 4y ago
PRIMES, checking whether a number is a prime number or not. It's important to note that this happens literally all the time in research. There are hundreds of problems that are easily seen to be _in NP_, that we simply don't know
426.
by JohnKemeny 4y ago
SAT is NP-complete even when the variable-clause graph is planar. Vertex cover is NP-complete on planar graphs even if each vertex has at most three neighbors. Travelling Salesman is NP-complete on planar graphs. So is independent set, domi
427.
by JohnKemeny 4y ago
I've used this a lot with a Walcom trackpad, mostly for teaching under lockdowns. Note that this is a rewrite of Xournal (a GTK application), and there are still some things Xournal get better, but many things xournalpp do better. It&#
428.
by JohnKemeny 5y ago
Hey, great article, great topic! You missed one very interesting angle for the problem (speaking of games), namely Voting theory , which is an important part of game theory! In voting theory, there is a concept called Kemeny ranking (Kem