Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
skew
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
24 ms
·
1.
▲
by
skew
5y ago
It's smaller, but not actually negligible. An old but oft-cited 2002 study said a laptop with a three year lifecycle took about twice the energy to manufacture as operate. Silicon is much more energy intensive than other materials, wit
2.
▲
by
skew
9y ago
Interesting that you mention neutrino astronomy - if you mean imaging, I don't know of anything but gravity that could focus neutrinos.
3.
▲
by
skew
10y ago
You haven't got many fun answers yet? Here are a few nice programs http://incredible.pm/ http://fluffynukeit.com/software/fnistash/ http://hledger.org/ If you're looking
4.
▲
by
skew
10y ago
Dare I hope "arguments against anthropomorphic global climate change" was not a typo? If not, please share!
5.
▲
by
skew
10y ago
Do you mean "seL4 is great"? I agree it won't do much for application-level security without adding some formally verified code on top (perhaps as simple as setting up isolation between VMs), but it looks great if you do want
6.
▲
by
skew
11y ago
Why do you think D-wave machines can be clustered at all? Unless you say it's operation is not essentially quantum, that would mean demonstrating coherence between a bunch of machines and a scalable quantum network!
7.
▲
by
skew
11y ago
I disagree extensively - raw data should definitely be available, and there are a number of interesting things you can do with it without any special expertise. For one, evaluating whether those adjustments even affect any overall conclusio
8.
▲
by
skew
11y ago
I'm sceptical that you've ever actually tried to get any data. The first sentence of NASA's GISTEMP page tells you where they get there data, and a few more clicks will get you to daily logs for a decent chunks of it.
9.
▲
by
skew
11y ago
http://www.caltech.edu/news/caltech-announces-discovery-fund...
10.
▲
by
skew
12y ago
The response to the client is only sent after a majority of followers have the log entry. That's described in the text in the "Protocol Overview", and nicely animated in "Log Replication".
11.
▲
by
skew
12y ago
Non-Turing-complete is not a bad way to go. You pretty much have to already be a researcher in dependent type systems (or maybe set theory) to invent functions that always terminate but can't be written in non-Turing-complete languages
12.
▲
by
skew
12y ago
That sounds like a pretty reasonable density to see savings in threaded forth code like the second post talks about (it also mentions adjusting the shift for other densities). Second, you don't need to reserve excess state at the end l
13.
▲
by
skew
13y ago
Wasn't that precisely the first complaint - observing a pair of incidents which make no sense as a consistent policy? (the second complaint being that even a senator had trouble clearing up a mistake). Both the original comment and rep
14.
▲
by
skew
13y ago
Regarding those particular operators, + is conventionally reserved for commutative operations (e.g, http://en.wikipedia.org/wiki/Plus_and_minus_signs#Plus_sign ).
15.
▲
by
skew
13y ago
"kinetic energy" means nothing alone, thrust and specific impulse are better metrics to look at. Doing a lot better than ion thrusters at either without being too much worse in the other and energy efficiency would be interesting. However,
16.
▲
by
skew
14y ago
That's actually the only place ML^F ever requires type annotations - when you want to take a polymorphic function as argument and use it at different types. MLF is basically as strong as inference for polymorphic types gets, so it's not sur
17.
▲
by
skew
14y ago
There are some nice examples of re-using the same code at successively more interesting types in Conor McBride's ICFP keynote: http://www.youtube.com/watch?v=XGyJ519RY6Y (video only, the presentation was liveish coding in emacs and I have
18.
▲
by
skew
14y ago
The previous article really didn't make the argument "all you need is static typing". It was specifically refuting the idea that "all you need is unit testing" - or at least that unit testing is a complete replacement for static types. The
19.
▲
by
skew
14y ago
The first half is a bit easier - if you can show some implementation meets the specification it is at least consistent. The second isn't so clear, but sometimes you can get a bit more confidence by showing that other good properties are imp
20.
▲
by
skew
14y ago
Yes, foldr/build is almost exactly reducibles, but not foldables. Iterators do nothing for parallelism either.
21.
▲
by
skew
14y ago
Isn't foldr/build fusion much closer? A collection is represented by a "build" function that takes the reducer, and list transformers become reducer transformers. The main difference is that it's applied automatically by list library using
22.
▲
by
skew
14y ago
The cost model can be very simple. Take the cost model of Java and apply it to programs where all fields are final. Maybe costs are higher than you'd like, but it's simple to understand. Lazy evaluation seriously complicates the cost model,
23.
▲
by
skew
14y ago
That's incoherent. If you accept the claims of > People regularly say they translated their system from language A to language B and got 10-100 times code-size reductions. then it's clearly false at least for first systems that > th
24.
▲
by
skew
14y ago
Every language is based on a huge mass of things which might fall under "fully understanding the tool you're using". Do you have a sharper distinction separating type inference algorithms from other things like calling conventions or garbag
25.
▲
by
skew
14y ago
If you were really pedantic, you'd make a distinction between executing beta-reductions directly, and executing them in zero time. Here's hardware that does the first http://www.cs.york.ac.uk/fp/reduceron/
26.
▲
by
skew
14y ago
Do you ever try to understand the asymptotic performance of a program in terms of the source code, or only read compiled binaries? You can describe the performance of a functional program in something like asymptotic number of reductions. Y
27.
▲
by
skew
14y ago
> You can just as easily ask what the asymptotic 'cost' of using a non-random access Turing machine is. Precisely. For example, you can ask whether the best algorithm for some problem on a 1-tape Turing machine is asymptotically slower
28.
▲
by
skew
15y ago
Have any of these articles included hard numbers? These slides say GPS received power is around -160dBm http://www.ima.umn.edu/talks/workshops/8-16-18.2000/van-dier... I see unsourced claims LightSquared signals would be around -70dBm, wh
29.
▲
by
skew
15y ago
If there's a law that says you can call in the police to drag people away if they don't shut up when you tell them to, it certainly is an issue of freedom of speech.
30.
▲
by
skew
15y ago
Perhaps you should judge replies by the standard of civil disagreement set by the essay itself. The first paragraph of the essay says anyone who disagrees that copyright is a natural right "can go fuck themselves".
More ›