nonsequitur

6 ms·

1.
by nonsequitur 4y ago
Yes: https://zigbin.io/771ac5
2.
by nonsequitur 4y ago
Nix is turing complete (it can implement the Lambda Calculus), even conveniently so.
3.
by nonsequitur 4y ago
Hint: It's `catch {}` instead of `catch { ... }`.
4.
by nonsequitur 5y ago
This doesn't work because you're not left-shifting (doubling) the carry. But when adding the shifted carry to (x ^ y) we're back to potentially overflowing the highest bits. The solution is to add the highest and the lower bi
5.
by nonsequitur 5y ago
You can directly query `getaddrinfo` with getent ahosts myhost
6.
by nonsequitur 10y ago
There's no assignment to the „m“ variables that would make your algorithm work in the general case. im4w1l's strategy is just: Player i returns (i - [Sum of the other players' suits]) % 4 (With i ranging from 0 to 3)
7.
by nonsequitur 11y ago
Thanks! That paper is available on the author's website: http://gi.cebitec.uni-bielefeld.de/people/zsuzsa/papers/Algo...
8.
by nonsequitur 11y ago
Can anybody guess in which way he used convolution for solving what is generally known as the change-making problem? Wikipedia [1] mentions a "probabilistic convolution tree", but that seems much more involved. Edit: Solved. I&#x2
9.
by nonsequitur 13y ago
I was dissappointed with the quality of the code and the final demo game. Also, it uses DirectX. Here's an alternative: Dive into the GamePlay engine ( https://github.com/blackberry/GamePlay/ ) and go through all the samples ( https://git
10.
by nonsequitur 14y ago
Take some of that time to figure out the math and the code becomes trivial: for (n = 1; n <= 20; n++) { window.alert(n << (n-1)) } A short explanation: http://mathbin.net/98435
11.
by nonsequitur 14y ago
C++11 support in common compilers: http://wiki.apache.org/stdcxx/C++0xCompilerSupport
12.
by nonsequitur 17y ago
The complete "Force Concept Inventory" test (PDF): http://shs.westport.k12.ct.us/physics/2007-2008/FCI-rv95.pdf http://bit.ly/8YeiOZ (mirror)