Peaker

90 ms·

871.
by Peaker 14y ago
I don't think your argument about "traditional means of compression" holds. The existence of redundant data can be proven by the ability to store the same information with less data. Pi's information density is in fact no larger than the sm
872.
by Peaker 14y ago
If you use a Kolmogorov measure of complexity, the complexity of a function and/or its output is defined to be the description of that function using some universal language. So a function cannot, by definition, generate data that is mor
873.
by Peaker 14y ago
Lazy evaluation implies that you keep the result for re-use later if it is shared between multiple users. So if laziness causes performance problems, it is generally: * A space leak: The deferred computation holds lots of data alive for whe
874.
by Peaker 14y ago
I'm not sure measuring the number of CPU instructions makes much sense anymore. In my experience micro-optimizing code, the majority of time is spent waiting for memory (bandwidth waits or even worse: latency costs).
875.
by Peaker 14y ago
Programs are more than just algorithms, they are also documentation of that algorithm. Sometimes they also describe checked invariants of the execution of that algorithm (types). There's probably a lot more to say about programs that doesn'
876.
by Peaker 14y ago
Software is not patentable because it is software. Software is patentable by specifying the entire machine, cpu, memory and software that is used to achieve the purpose.
877.
by Peaker 14y ago
I don't actually use any MS software whatsoever. I think the clunkiness, the slowness, the instability, are objectively bad traits of Notes no matter your background.
878.
by Peaker 14y ago
I think the Lotus Notes as a GUI platform is so horrid that it couldn't possibly be good at anything: * It comes with a program "Zap Notes" which is supposed to kill it when it hangs (Wat?). A bit funny since "Zap Notes" doesn't even work f
879.
by Peaker 14y ago
Lotus Notes is one of the worst, most agonizing pieces of software I have had to use. When I read the headline, I had a glimpse of Hope that Lotus Notes might be discontinued, and that I may stop using that horrible, clunky, unstable, slow
880.
by Peaker 14y ago
The most important avenue of creative work is derivative works. Copyrights essentially ban almost all forms of derivative works -- thereby depriving society of the most important form of creativity. Also, old works are mostly lost to societ
881.
by Peaker 14y ago
"If/switch" branching is sometimes called "boolean blindness": http://existentialtype.wordpress.com/2011/03/15/boolean-blin... The reason is that no new type information is gained when you branch. When you pattern match, however, you gain
882.
by Peaker 14y ago
I don't really understand the justification for "There is no silver bullet". How do we know? There may very well be a silver bullet, after all, we've already had some! Programming now using modern tools is at least an order of magnitude mor
883.
by Peaker 14y ago
if-statement dispatching is not pattern matching. Pattern matching yields more type information than if statements and can match recursively on multiple arguments (which even multi-method dynamic dispatch cannot). However, it always dispatc
884.
by Peaker 14y ago
I had similar OTA frustrations with my Galaxy Nexus. Apparently I got an Australian carrier crippled build :( After flashing yakju once, all the updates flow smoothly.
885.
by Peaker 14y ago
My micro-usb cables are dying at about 1 per month. Getting high-quality cables around here is pretty difficult. I'd really love to toss away the cables (maybe keep 1 emergency one in my portable bag).
886.
by Peaker 14y ago
Well, I'm always looking for problems that are uniquely well solved by macros. Lisps pay a dear price to have macros. If their capabilities are covered otherwise (in ways that are not as costly), why have them?
887.
by Peaker 14y ago
People say Gimp has a different/worse UI, but roughly similar capabilities. Do you have a citation/basis to claiming Gimp is so much weaker?
888.
by Peaker 14y ago
For some features (your examples of linear types are good ones) the cost-benefit analysis is not clear. For other features (explicit nullability, sum types, etc) the cost-benefit is very clearly in favor of having those features, at least a
889.
by Peaker 14y ago
Output parameters are indeed a safety problem not solved by sum types. However, sum types would still give extra safety in most cases. Also, it is possible to differentiate a type of allocation and a type of a usable buffer, such that "io
890.
by Peaker 14y ago
Maybe you can do something like: A) Sort edges (descending). B) Have a total order between N-sized subsets by treating each edge as a binary digit (1 if it is in, or 0 if it is not). I believe this guarantees that the total order between th
891.
by Peaker 14y ago
I was expanding (with a slight correction about macros doing more than just controlling evaluation). Haskell-style laziness comes with purity, where it does not matter much whether something is evaluated once or many times. It does matter i
892.
by Peaker 14y ago
In Haskell, there's the "bracket" function with generalizes the "with" concept. withFile fileName mode = bracket (openFile fileName mode) hClose Then: withFile "/usr/share/dict/words" ReadMode $ \h -> do contents <- h
893.
by Peaker 14y ago
I don't think writing Template Haskell macros takes a lot of effort. It is probably harder than Lisp macros, but the main effort is studying the TH API once.
894.
by Peaker 14y ago
A language that is lazy by default lets you control the evaluation of arguments. Ordinarily, they're not evaluated, and if you force them they are. However, macros are not just about whether to evaluate -- but about exposing the internal sy
895.
by Peaker 14y ago
The set of all possible costs is the set of sums of all N-sized subsets of the edges. You only need to binary search that set, not the real numbers' axis. The set's size is exponential to N, but binary searching is logarithmic, so it becom
896.
by Peaker 14y ago
Oops, quick-typing on my phone can have problematic results :-)
897.
by Peaker 14y ago
map (head &&& length) . sort . group filterM (const [True, False]) Can you show how you implement these in D? If you want, I can explain these or give other examples of expressiveness I don't think you'll find in D.
898.
by Peaker 14y ago
In Haskell: http://hpaste.org/77404
899.
by Peaker 14y ago
Telephony might be routed over IP too.
900.
by Peaker 14y ago
In really close elections, the outcome matters much less than the potential for systematic rigging of non-close elections.

More ›