daivd

7 ms·

61.
by daivd 14y ago
It worked fine for me. I asked an obscure stack overflow question about the Google App Engine SDK and an OpenSSL bug in Ubuntu 12.04 a few days ago and got prompt support. Besides that it is trendy to pick on Google, I think that the proble
62.
by daivd 14y ago
I agree that you need to keep a direction for SE, but there is one type of open-ended conversation starters that often works really well there - the list. E.g "What feature would you like to see in C++15 (or whatever the next one will be ca
63.
by daivd 14y ago
Since Nix keeps multiple versions of almost the same binaries, it seems to me that something like ZFS, where several files can share the same physical block on disk, is the perfect match. Is that something you recommend when using NixOS?
64.
Selfspy - Log everything you do on your computer(gurgeh.github.com)
7 points by daivd 14y ago|0 comments
65.
by daivd 14y ago
There are good tutorials to Haskell, but it seems to me that Haskell best practices still evolves fairly quickly. After "Real World Haskell" and "Learn you a Haskell", I still did not know what most of the GHC extensions are for (especially
66.
Guerilla - My attempt to build a strong AI(fakeguido.blogspot.com)
9 points by daivd 15y ago|0 comments
67.
Radiation from various sources, to scale in Prezi(prezi.com)
1 points by daivd 16y ago|0 comments
68.
by daivd 16y ago
It is real brute force, but I do not investigate some stupid nodes. If I choose to not use an available jar during a timestep, I disqualify that jar, until another jar has been used, since there is no point in waiting to use a jar unless yo
69.
by daivd 16y ago
How about the same problem, but with each Jar having: a) a known fail percentage - 40% of the time the Jar fails and produces nothing. Maximize expected win. b) an unknown fail percentage, evenly distributed between 0 and 100%. Find a strat
70.
Rescuing a hosed system using only Bash(fakeguido.blogspot.com)
7 points by daivd 16y ago|1 comments
71.
Milliblogging - An essay in 7 tweets(fakeguido.blogspot.com)
1 points by daivd 16y ago|0 comments
72.
by daivd 16y ago
Ytterby is not an island. It is a village _on_ an island: http://en.wikipedia.org/wiki/Ytterby
73.
by daivd 16y ago
If I understand this correctly, saying that vowels tend to be close to vowels is just a special case of using n-grams. If you have a fingerprint with the common n-gram distribution for the target language (or even subject), you get an optim
74.
Digital immortality, true AI and the destruction of mankind(fakeguido.blogspot.com)
10 points by daivd 16y ago|7 comments
75.
by daivd 16y ago
OK, I will try it. And if you had said that it would be almost impossible, because there are too many local minima, I would have believed you. A serious try with GA would require abandoning Python for a faster fitness function in C, that do
76.
by daivd 16y ago
It is the refusal to exploit any specific properties that makes it fun :). Real Sudoku solvers have been around for ages.
77.
Solving Sudoku with genetic algorithms(fakeguido.blogspot.com)
41 points by daivd 16y ago|14 comments
78.
by daivd 16y ago
Not those kinds of entertainment games, but dual-n-back might do something. See for example http://en.wikipedia.org/wiki/Dual-n-back and http://www.brainboffin.com/
79.
Ask HN: Board member compensation?
4 points by daivd 17y ago|0 comments
80.
by daivd 17y ago
Making it shorter is trivial :) I have never tried posting code here, so I I'll try to get the formatting right. #The import line is unnecessary. It can be inlined, like so: def is_prime(i): return (i > 1 and all(i % x != 0 for x