jkabrg

17 ms·

31.
by jkabrg 8y ago
It's a one-liner in quaternion algebra: vu-|vu| followed by normalization. Proof can be carried out completely in quaternion algebra. An interesting degenerate case is when u=-v. In that case, another expression can be used: PERP(v)(vu
32.
by jkabrg 8y ago
I guess it provides an objective definition of when something is simple or complicated. This could have applications in statistics or machine learning, where "simpler" hypotheses could be less likely to overfit. There are computab
33.
by jkabrg 8y ago
"TFA" is one paragraph long. BTW your usage of "TFA" can come across as rude.
34.
by jkabrg 8y ago
I don't think the UK (for one) is especially hierarchical. For instance, people in the modern UK (as opposed to in Agatha Christie novels) are usually referred to by their first names. And still a Chinese friend of mine told me he foun
35.
by jkabrg 8y ago
This talk goes into some detail about the history of Chinese typewriters: https://www.youtube.com/watch?v=tdT-oFxc-C0 -- the presenter claims that a form of predictive text first originated for Chinese typewriters. This is
36.
by jkabrg 8y ago
Being told to confess (confess! confess!) sounds downright medieval. [Redacted some stuff comparing American police to police in some other countries, accusing them of being especially aggressive.] I don't know why anybody would accept
37.
by jkabrg 8y ago
In my university days, I used a word processor (Libreoffice Writer) as a kind of clipboard: I would copy and paste tables and webpages into it, and use it for something , I don't recall what. It's a bit like a quick-and-dirty Dre
38.
by jkabrg 8y ago
What's this poking fun at: "because everything is terrible"?
39.
by jkabrg 8y ago
The arguments you made don't challenge what the article says one bit. The loss aversion hypothesis is the hypothesis that given the choice between either of the following two scenarios: - Having an object x and then risk losing it.
40.
by jkabrg 8y ago
The relevant term might be fpt-reduction. Also some NP-COMPLETE problems are not fixed parameter tractable as far as we know, but some are.
41.
by jkabrg 8y ago
What about freehand drawn diagrams? It seems pretty fast and intuitive, and would deal with your problem* . Are there any tools for making freehand diagrams look professional? It would be analogous to how Markdown makes "crude" te
42.
by jkabrg 8y ago
It's not guaranteed that the current hardware will scale to many more qubits. And they haven't passed the threshold to "quantum supremacy".
43.
by jkabrg 8y ago
Scott Aaronson explained how this claim is wrong. Quantum computing is not the same thing as "analog computing". See his response to "a quantum computer would merely be a souped-up analog computer" here: https:/&#x
44.
by jkabrg 8y ago
Attacks only get better over time. In a sense, there are security flaws in every computer program, which only get clearer with time. The issue here is that these flaws are in a CPU, which is a component that's very difficult to change,
45.
by jkabrg 8y ago
LEO?
46.
by jkabrg 8y ago
Wow. Explain?
47.
by jkabrg 8y ago
The dual numbers contain infinitesimal numbers but not infinite numbers. Oppositely, the variable X of a polynomial behaves much like an infinity, but is not invertible. Their argument depends crucially on whether infinitesimals/infini
48.
by jkabrg 8y ago
It depends on the context. ∞ is sometimes defined as the point on the projective real line equal to both +∞ and -∞.
49.
by jkabrg 8y ago
Has anybody tried running some old computer viruses on it? Or what about those "tech support" calls you get, where they try and take over your Windows computer? It would be fun to follow their instructions in ReactOS, mainly out o
50.
by jkabrg 8y ago
Is this a very crude summary of Pontryagin's principle? Basically, you use Lagrange multipliers to solve a constrained optimization. In contrast, dynamic programming is based on stitching together optimal sub-solutions.
51.
by jkabrg 8y ago
Where have people used Gaussian Processes to good effect? And how do they compare to competing models? There appears to be a lot of theory in this book, and I'm wondering how much of it is useful to applied data science.
52.
by jkabrg 8y ago
I still prefer pencil and paper. I find it's the least limiting because you can draw anything, the easiest to use because you don't have to learn a GUI or a language, and the fastest -- yet software people will still wonder how th
53.
by jkabrg 8y ago
WalterBright posted the following code snippet somewhere above: char foo[9]; foo[] = "abc"; foo[3..3+5] = "1234"; `foo` is an array. `foo[3..8]` is a slice, which is an object that does its own bounds-checking.
54.
by jkabrg 8y ago
Which "comparable western nations" are you referring to?
55.
by jkabrg 8y ago
What's the advantage of Wordstar over: - Word - Emacs/VIM + Markdown + Latex + Pandoc - VScode/Atom + Markdown + Latex + Pandoc - LyX Very cool otherwise.
56.
by jkabrg 8y ago
Could someone explain to me how this would work for a (bytecode) interpreter? I'm thinking a few thoughts: - Interpreted programs can carry out Spectre attacks - Interpreted programs are un-analysable using a technique that does
57.
by jkabrg 8y ago
No, not really. A SAT solver checks if there's a model in which a formula is true, while this program checks if the formula is true in every model. It's believed that there's no efficient reduction from one to the other, beca
58.
by jkabrg 8y ago
I'll add that the significance of the formula is it's similar to a*b + a*c = a*(b + c) which you ought to remember from school as "factoring/factorization". Except in this case, " * " is replaced wi
59.
by jkabrg 8y ago
For people who don't understand the dots and colons, OP's proposition can be expressed in modern notation as ((p V q) -> (p V r)) -> (p V (q -> r)) It's easy to justify this tautology by considering the case w
60.
DVC (Data science Version Control)(dvc.org)
1 points by jkabrg 8y ago|0 comments

More ›