Viewing profile — bmc7505
bmc7505
HN member- Joined
- Tue, Jul 15, 2014, 2:22 PM UTC
- HN karma
- 3,165
- Public activity
- 501 items
- HN profile
- View on Hacker News ↗
About bmc7505
Interested in programming languages and machine learning.
https://twitter.com/breandan
https://github.com/breandan
https://breandan.net/
Recent public activity
-
comment
Comment #49149457
Cool to think this demo would have been possible over fifty years ago. I wonder what someone from 1975 would have said if you had shown this to them back then.
- story
-
comment
Comment #48282784
This topic recently came up at the FLANN workshop [1], and seems to periodically be rediscovered [2,3,4] in different contexts. While some have speculated about the biological role…
- story
-
comment
Comment #47697517
I've recently been using this plugin [1], which is still under development but is an adequate stopgap until a better solution comes along. [1]: https://plugins.jetbrains.com/plugin…
- story
-
comment
Comment #47243888
As foretold six years ago. [1] [1]: https://breandan.net/2020/06/30/graph-computation#roadmap
- story
-
comment
Comment #47195207
Fast matrix multiplication would be a more useful benchmark: https://fmm.univ-lille.fr/
-
comment
Comment #47091143
17k TPS is slow compared to other probabilistic models. It was possible to hit ~10-20 million TPS decades ago with n-gram and PDFA models, without custom silicon. A more informativ…
- story
-
comment
Comment #46529854
There are a few approaches if you want to write a new language. One, as the author argues, is to write a library in an existing language, which may require sacrificing ergonomics t…
-
comment
Comment #46371187
Interesting. I wonder if mqjs would make it feasible to massively parallelize JavaScript on the GPU. I’m looking for a way to run thousands of simultaneous JS interpreters, each wi…
- story
-
comment
Comment #44766849
You could argue that since automatic differentiation and symbolic differentiation are equivalent, [1] symbolic AI did succeed by becoming massively parallelizable, we just needed t…
-
comment
Comment #44766740
> The solvers participating in this track will be executed with a wall-clock time limit of 1000 seconds. Each solver will be run an a single AWS machine of the type m6i.16xlarge, w…
-
comment
Comment #44763838
The difference is that SAT/SMT solvers have primarily relied on single-threaded algorithmic improvements [1] and unlike neural networks, we have not [yet] discovered a uniformly ef…
-
comment
Comment #43979622
The correct way to do this is with finite model theory but we're not there yet.
-
comment
Comment #43581982
Gingsberg stole it from Yeats — “the best lack all conviction…” / “the best minds of my generation…” — many similar verses, e.g., “what rough beast…” / “what sphinx of cement…” htt…
-
comment
Comment #43121939
https://cstheory.stackexchange.com/questions/632/what-is-the...
-
comment
Comment #43033521
Called it three years ago: https://news.ycombinator.com/item?id=30142353
- story
-
comment
Comment #42678668
https://dl.acm.org/doi/10.1145/3704837
- story
-
comment
Comment #42660767
Depending on how comfortable you are with model theory you might also enjoy Dzhafarov and Mummert’s textbook, which first brought the subject to my attention.