rrobukef

22 ms·

241.
by rrobukef 7y ago
Sushi is rice with a topping. It's boring too.
242.
by rrobukef 7y ago
No, I'm disagreeing. Kids just out of highschool are not full adults. They should be able to learn to apply themselves while not losing the chance to be an engineer. University allows for that freedom, an apprenticement doesn't. U
243.
by rrobukef 7y ago
Looking at it from the other side: maybe most would have become decent engineers, but a large number wouldn't have the maturity to apply themselves. They would be unhappy because they didn't know the landscape of their profession
244.
by rrobukef 7y ago
You could simulate the recursion with an iteration, a depth byte and a stack-array of 32 pointers (64 for overkill). This removes the frame pointer and makes the temporaries clear too.
245.
by rrobukef 7y ago
And doubles have some 2^50 NaN's. It's possible to create a tagged pointer of either a double, 32-bit integer, pointer or a small string and still have space for more. Sadly the original Mozilla link is broken. https://
246.
by rrobukef 7y ago
Most things I listed are pre-2007, minisat 2.2 had all but literal block distance. Which, I think, has proven itself since glucose replaced minisat in the hack thread. You're probably right about the kitchen sink approach, however with
247.
by rrobukef 7y ago
And even with CDCL and 2-WL a new implementation won't come anywhere near the performance of the best. The engineering precision involved in 3k core lines of minisat/Glucose is astounding: pre-processing, in-processing, optimalisa
248.
by rrobukef 7y ago
The provided example ([rust playground]( https://play.rust-lang.org/?version=stable&mode=release&edit... ) can generate assembly ('...' next to 'Run'). `main` just calls `panic` immediately. The fu
249.
by rrobukef 7y ago
Not a fan of prolog then? As an excercise, find the guard in this snippet ( https://rosettacode.org/wiki/Babbage_problem#Prolog ) and imagine such code in a team codebase!
250.
by rrobukef 7y ago
The comment twice stands for some complex logic with side-effects which calculates value. You shouldn't put that in a ternary if, in most languages you can't. And even then I would reverse the order, placing the exceptional and sh
251.
by rrobukef 7y ago
I'm also a fan of early exits, for more reasons than in the post: an early return results in less nestings and less variables, it makes the code simpler. Consider: Option<T> sink(int pos) { if(pos>=this.length())
252.
by rrobukef 7y ago
https://www.copyright.gov/title17/92chap1.html#107 It was not for a purpose specifically mentioned, other fair uses require lawyers. The use was commercial, and it was the whole (?, I did not see the poster) image. Sin
253.
by rrobukef 7y ago
The discussion is the meaninglessness of the parentheses. ⇔ is indeed commutative and associative which means that we can define removing the parentheses as equivalent. However it is equally valid to not do this and define an n-ary '⇔&
254.
by rrobukef 7y ago
So it is.
255.
by rrobukef 7y ago
Why not? The sky if green if and only if pigs can fly if and only if water is wet. The sky if green if and only if pigs can fly is true. True if and only if water is wet is true.
256.
by rrobukef 7y ago
https://en.wikipedia.org/wiki/Logical_biconditional (A⇔B)⇔C has more in common with the other logical operators: due to it's associativity an interpretation that is, in my opinion, closer than A=B=C. Edit, remov
257.
by rrobukef 7y ago
My standard interpretation is ((A⇔B)⇔C). A=F ,B=F ,C=T differ in evaluation. * edited T to F
258.
by rrobukef 7y ago
OP probably meant within the current context. An NP problem is defined to have a (polynomial sized) proof that can be checked in polynomial time by definition.
259.
by rrobukef 7y ago
No, since a proof is finite. When you enumerate Turing machines to generate a proof you execute the first n machines for n steps. At some point some machine must decide something, so some n is the bound.
260.
by rrobukef 7y ago
Deductive verification is a large extension of designing by contract: The addition of a SMT solver to verify the contracts at compile time for instance. On the other hand libhoare only adds the contracts as a runtime addition with no mentio
261.
by rrobukef 8y ago
And EM characteristics are fixed.
262.
by rrobukef 8y ago
Most search trees only need a total ordering on the elements. A radix tree has stricter requirements: the data can be split in parts (e.g. x in x[0]..x[n] and y in y[0]..y[n]) such that each part has a total order and the original order is
263.
by rrobukef 8y ago
Actually, there is a fingerprint in my phone. It isn't any of my fingers (I can't recall, maybe my elbow). Will I be in contempt of court for scanning my finger 'wrong'. I don't think my elbow will work a month late
264.
by rrobukef 8y ago
alias cdl="cd (ls -ltr1 | grep '^d' | tail -1 | awk '{print $9}');" cd to last directory by date.
265.
by rrobukef 8y ago
Internet of ThingS, indeed security comes last.
266.
by rrobukef 8y ago
I share his opinion for scientific software. I think this is because it is building an algorithm versus software. I think the coupling and scope are just too different. If your loop takes billions of iterations on gigabytes of data before r
267.
by rrobukef 8y ago
The link works now.
268.
by rrobukef 8y ago
The article hasn't been published for a whole day and the link to the announcement (the first link) is already broken. Can anyone provide it? Thanks
269.
by rrobukef 8y ago
The only reference to his site is hidden behind 3 screens in a URL. All ads are stripped, his brand is stripped. I don't think he must celebrate (though he seems happy).
270.
by rrobukef 8y ago
Yet he has a job, it seems he's had steady jobs. In the same group there is Sid, the software developer, Mira, the defence attorney, and Ian, the recent debt-free Google employee. All three are in the same 'mess' and pay very

More ›