Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
bmc7505
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
by
bmc7505
3y ago
Isn't CZ already being sued by the CFTC? Is cryptocurrency a security or a commodity and under whose jurisdiction does Binance fall? Or were they trading in both types of instruments? https://news.ycombinator.com/item?i
62.
▲
by
bmc7505
3y ago
Just gotta keep on trucking. Either way, I would be interested in seeing how the 2XSAT reduction works. Don't get discouraged!
63.
▲
by
bmc7505
3y ago
Is superoptimization related to supercompilation, or are these unrelated compiler optimization techniques? From what I have read, it seems like Turchin [1] et al. are trying to prove equality using some sort of algebraic rewriting system (i
64.
▲
by
bmc7505
3y ago
There is a qualitative difference in both perception and intent between a figure of speech, and a machine specifically designed to impersonate a human. Although we articulate familiar concepts in anthropomorphic terms, no reasonable listene
65.
▲
by
bmc7505
3y ago
I have been making a similar argument for some time. The choice to anthropomorphize dialogue systems and large language models is a clichéd and misleading UI design choice. By presenting chatbots as disembodied persons, we are implicitly su
66.
▲
by
bmc7505
3y ago
Thank you for the detailed reply, this is the first cogent answer I have read that explains why GPU solvers are not as widely used in SAT. The argument that we should focus on getting sequential solvers to run fast, then parallelizing that
67.
▲
by
bmc7505
3y ago
I remain skeptical. NC=P? is still an open conjecture, so there could be problems which are decidable in P, but only when using a polynomial number of processors or superpolynomial on a single processor, but polynomial on a polynomial numbe
68.
▲
by
bmc7505
3y ago
Isn’t UP complete with respect to CNF satisfiability though? How does P completeness relate to parallelizability of SAT?
69.
▲
by
bmc7505
3y ago
It depends on the sharding granularity. If you choose a low sharding ratio, then you waste a whole core, but that's assuming 1:1 shards to cores. If you shatter the search space using a large multiple of the number of cores, e.g. 1000:
70.
▲
by
bmc7505
3y ago
Using a naive splitting strategy is trivial, but ensuring the distribution is well-balanced across the subspaces is not. You need to preprocess the formula by setting the variables, then doing some propagation, then restarting, otherwise on
71.
▲
by
bmc7505
3y ago
My hunch is that CDCL is probably the wrong approach to take for parallelization due to synchronization issues. You want an algorithm that is communication-free or makes belief propagation wall-clock competitive for large set of instances.
72.
▲
by
bmc7505
3y ago
Interesting. Do you have a link where I can read more about that? How does this relate to k-SAT or CNF complexity, isn't UP is complete w.r.t. these problems?
73.
▲
by
bmc7505
3y ago
The 2^n idea is just a thought experiment, but you should be able to realize linear or close-to-linear speedup using a communication-free algorithm that shards the search space evenly across available cores, no? I don't see why this st
74.
▲
by
bmc7505
3y ago
Oh you're one of the GPUShareSat guys, I forgot about that one. Would you say the main obstacle to scaling to a million processors is the synchronization overhead or are there certain instances from the SATComp benchmark that exhibited
75.
▲
by
bmc7505
3y ago
That’s SATComp, I was talking about the MAXSAT competition.
76.
▲
by
bmc7505
3y ago
> SAT doesn’t exhibit the nice properties other optimization problems often have where you can tell when you’re near a correct answer. You mean like a metric? Not all SAT instances have a natural metric, maybe a large fraction could be r
77.
▲
by
bmc7505
3y ago
I was thinking there might be some theoretical barrier to parallelization, e.g., maybe naturally-arising SAT instances have poor empirical scaling constants [1], so sequential solvers with good branch heuristics are pretty close to optimal.
78.
▲
by
bmc7505
3y ago
And yet, despite tremendous progress accelerating continuous optimization workloads, there are still no competitive GPU-based SAT solvers. I wonder why?
79.
▲
by
bmc7505
3y ago
There were number of innovative but relatively obscure languages that came out of the first wave of cybernetics. Glushkov, one of Lyapunov's contemporaries, created a language called Analytik [1], with early support for linear algebra
80.
▲
by
bmc7505
3y ago
You asked about my beliefs and I engaged your question in good faith. Good day, Sebastian!
81.
▲
by
bmc7505
3y ago
Although I think their hearts are in the right place, AI safety researchers are primarily driven by irrational instincts and misjudge the promise and perils of artificial intelligence. If humanity chooses to turn away from God and sacrifice
82.
▲
by
bmc7505
3y ago
The problems that AI will manifest are the result of human ambition and failings, no different as any other technology that empowers individuals. Yes, individuals and organizations will misuse AI for immoral purposes, but the popular belief
83.
▲
by
bmc7505
3y ago
It’s a LARP at best and a scam at worst. I shared some of my thoughts on the matter in a prior thread: https://news.ycombinator.com/item?id=35145189#35147288
84.
▲
by
bmc7505
3y ago
I am disappointed with increasing frequency to learn how certain individuals whom I previously believed to be serious scholars fall for the cargo cult of AI safety. Personally I find it difficult to believe they are willfully participating
85.
▲
Courcelle's Theorem
(en.wikipedia.org)
1 points
by
bmc7505
3y ago
|
0 comments
86.
▲
by
bmc7505
3y ago
My great-grandfather also perished in a mine collapse near Wilkes-Barre, PA, sometime in the 1920s. I remember my grandfather, who was still a child when it happened, telling me about how the miners were treated. He was forced to take a job
87.
▲
by
bmc7505
3y ago
https://fingfx.thomsonreuters.com/gfx/legaldocs/akpeqynglpr/...
88.
▲
Building Acronyms by Contextually Retrieving Optimal Names with FuzzY Mining
(jonbell.net)
2 points
by
bmc7505
3y ago
|
0 comments
89.
▲
Machine Learning, Linear Algebra, and More: Is SQL All You Need? [pdf]
(cidrdb.org)
2 points
by
bmc7505
3y ago
|
0 comments
90.
▲
by
bmc7505
3y ago
Relevant: https://www.cidrdb.org/cidr2022/papers/p17-blacher.pdf
More ›