anaphor

47 ms·

421.
by anaphor 12y ago
You're right, but lots of people know about DOOM and Quake right?
422.
by anaphor 12y ago
If The Social Network is a movie then I don't see why the story of Id Software couldn't be a movie.
423.
by anaphor 12y ago
The false-positive rate is already sky high because the probability of any given person being a terrorist is extremely low, and because of Bayes' theorem that makes profiling generate a lot of false positives.
424.
by anaphor 12y ago
relative risk increase != absolute risk increase, and I hate when news articles say "20% higher chance of X" without saying the absolute risk.
425.
by anaphor 12y ago
I recommend Lisp In Small Pieces (LISP) by Christian Queinnec and Compiling with Continuations by Andrew Appel if you're interested in writing a functional compiler. Also: http://matt.might.net/articles/cps-convers
426.
by anaphor 12y ago
I got it with curl -I 185.31.18.133 --header "Host: mattias-.github.io"
427.
by anaphor 12y ago
Yeah I don't know. I only mentioned screen to be fair. I use tmux and I don't usually have any problems, although I get problems when I use it with mosh sometimes (particularly weechat mouse support doesn't seem to work well)
428.
by anaphor 12y ago
I just alias my terminal shortcut/command to start screen/tmux every time
429.
by anaphor 12y ago
Well nested data parallelism generally applies to hierarchical structures like trees, whereas flat data parallelism applies to things like arrays and whatnot. You might want to watch this (similar in some ways) talk by SPJ on Data Parallel
430.
by anaphor 12y ago
They could've done something similar to what you do when you implement a functional language in C and used a union to represent every possible return type, and included functions (closures if you will) in that union, then you solve the
431.
Conservation laws for free(lambda-the-ultimate.org)
11 points by anaphor 12y ago|0 comments
432.
USA Today FBI Propaganda Piece(usatoday.com)
4 points by anaphor 12y ago|0 comments
433.
Etymology of “dither”(en.wikipedia.org)
2 points by anaphor 12y ago|0 comments
434.
by anaphor 12y ago
>It's possible (due to the Halting Problem) that we keep getting applications no matter how much we try to simplify, in which case we've hit an infinite loop while trying to calculate "t", and hence we can never reach
435.
by anaphor 12y ago
Why did you decide to use sha256 instead of a kdf like bcrypt or pbkdf2? I'm not attacking you, genuinely curious.
436.
by anaphor 12y ago
eval is not a good idea if you want to write a compiler that generates small efficient binaries either. This is why, for example the Stalin Scheme compiler does not include eval. "Running that image has equivalent semantics to loading
437.
by anaphor 12y ago
Or even C, which some parts are written in, although it doesn't look like they're particularly friendly to lots of people changing them (IIRC some of the parsing and lexing code is in C, correct me if I'm wrong).
438.
by anaphor 12y ago
I recommend giving The Conquest of Happiness by Bertrand Russell (yes, he wrote what amounts to a self-help book) a read. Despite being outdated by a long while, it's still pretty relevant and useful imo. https://archive.org
439.
by anaphor 12y ago
Couldn't they distribute the signatures to the faculty and students in some semi-secure way?
440.
by anaphor 12y ago
Sorry, I still don't believe that's a problem. Unused variable warnings can be silenced easily if they aren't real bugs (for example an unused parameter in a callback). Most people don't have to deal with this stuff beca
441.
by anaphor 12y ago
I still don't see the problem, warnings usually indicate problems with the code, even if that particular sort of warning was added in a new version of the cc. If they don't indicate actual problems then the compiler is broken, but
442.
by anaphor 12y ago
"Werror is a guarantueed build break whenever the build is tried on a system the original developer had no access to." Yeah, if your program uses undefined behaviour or your cc is crazy. I think the point is to catch undefined beh
443.
by anaphor 12y ago
just to clarify, you mean fast immutable hash tables that support insertion right? (Which I agree is hard) Otherwise you can just use a BST or something and it's fast enough for lookups.
444.
by anaphor 12y ago
Please don't misunderstand my post as an attack on research that has a more theoretical impact. What I'm saying is that if you claim to have found a faster version of some algorithm, then it should actually be true (preferably wit
445.
by anaphor 12y ago
Thanks, this is a pet peeve of mine. Theoretical bounds are all nice and such, and it's cool if you can prove a better running time using some algorithm, but if it doesn't actually perform better in practice most of the time then
446.
by anaphor 12y ago
Most clients will break it up into multiple messages no?
447.
by anaphor 12y ago
It's still a legal problem as much as running an exit node is, they just can't easily figure out that you did anything because of how Tor works. You couldn't even confess to anything either if you wanted to.
448.
by anaphor 12y ago
It would also be nice if they tested builds with infrequently used options. I've tried building with documented options, e.g. no-comp (disables compression) and it completely failed. Presumably because the CPP generated something that
449.
by anaphor 12y ago
You're vastly overstating the difficulty in porting LibreSSL. It's 99% POSIX standard use of APIs and modern portable C except for a few security related functions they use that are non-standard such as explicit_bzero, reallocarra
450.
by anaphor 12y ago
Nobody thought of Hest? I admit it does sound kind of silly though, but it's got the 'H' at least, and it doesn't sound like Rest.

More ›