Tweetovi
- Tweetovi, trenutna stranica.
- Tweetovi i odgovori
- Medijski sadržaj
Blokirali ste korisnika/cu @shachaf
Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @shachaf
-
When you (in Facebook's words) "Set up a modern web app by running one command", this is what happens: https://npm.anvaka.com/#/view/2d/react-scripts …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je Tweet
A really nice proof of Pythagoras’s theorem and the cosine rule.https://twitter.com/mathforge/status/1212886233921343489 …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
OK, I think it's just clause deletion. I misread MiniSat's output as indicating that it wasn't deleting that many clauses, so I thought there was something else going on, but in fact it deletes over 98% of the clause database over its run on this instance.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Anyone into SAT solvers? I wrote a simple version of FirstUIP CDCL but -- despite reducing decisions and units a lot -- it made my solver much slower (even with 2-watched-literals). Is it just that I'm not deleting clauses yet? How can I tell whether my learnt clauses are bad?
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Talk about falsifiability has always seemed kind of funny to me. The negation of a falsifiable statement ("all swans are white") is a verifiable statement ("there exists a nonwhite swan"). Both are perfectly reasonable!
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
People talk about "optional" garbage collection, where you can choose whether to use GC or not. But standard GC is a global property of your program -- if a library uses GC, you're forced to too. The only viable actually optional GC would have to be local. Does anyone do that?
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je Tweet
This insanely cool dynamic history of infectious diseases before/after vaccines. Makes you want to stand up and cheer every time a disease bar goes green and slams down

Another big h/t to u/rarohdepic.twitter.com/F7ffsYZaBTPrikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
What's a good library for ordered key-value maps? I wrote a pretty naive in-memory B+ tree in C, and it's a fair bit faster than Rust's BTreeMap<u64, u64> and absl::btree_map<uint64_t, uint64_t> at most workloads. Is there another library I should benchmark against?
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je Tweet
You have a pack of 52 playing cards. • Shuffle the cards. • Pick a card at random. • Note what it is. • Return it to the deck. • If you’ve now seen every card, you’re done. • Otherwise, repeat. What is the expected number of cards picked, rounded to the nearest integer?
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
"left inverse" is such a bad term -- I always have to triple-check which way is which. But "pre-inverse" seems almost as confusing. I've been trying to use "section"/"retraction", but is there a better alternative?https://twitter.com/tsion/status/1201615177260531714 …
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je Tweet
A full rebuild of a ten-million line program should take less than a second on a modern many-core x64 processor.https://twitter.com/Atrix256/status/1199822770525200384 …
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je Tweet
Literally. As in, the truth table for a^b is A^B = 0xaa ^ 0xcc = 0x66. The truth table for "~a & c" is ~A & C = 0x44. The truth table for "a | b | c" is A|B|C = 0xfe. And so forth.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
shachaf proslijedio/la je TweetHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
shachaf proslijedio/la je Tweet
GCC's assembler syntax https://www.felixcloutier.com/documents/gcc-asm.html …
@gnutoolsHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
This seems to work well in practice, even under weaker conditions: Many SAT solvers use this schedule (called "Luby restarts") even though they keep state between runs, rather than being truly independent.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Even assuming a "worst case" -- every run of size <2^k is wasted, and effectively so is any time past 2^k -- you get enough trials of the right size to be within a constant factor of (2^k,2^k,2^k,...).
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
The optimal schedule looks like this: (1,1,2,1,1,2,4,1,1,2,1,1,2,4,8,1,...). At the time that you finish your first run of size 2^n, you've spent as much total time on runs of each size, 1,2,...2^n.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
But what if you don't know the distribution? It turns out you can get within a constant factor of the optimal restart schedule! This is described in _Optimal Speedup of Las Vegas Algorithms_ by Luby, Sinclair, Zuckerman (<https://www.cs.utexas.edu/~diz/pubs/speedup.pdf …>).
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
If you know the distribution, you can figure out an optimal restart point t such that it makes sense to restart after t steps. Since runs are independent, you'll want to repeatedly wait t steps before restarting.
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi -
Luby restarts: A Las Vegas algorithm is an algorithm which is guaranteed to succeed, but whose runtime is random. If you start a run, and wait for some time, at what point should you restart and hope to save time?
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.
(I'm going first)