Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ziedaniel1
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
ziedaniel1
1y ago
A little bit too concise IMO. E.g. it doesn't really explain where the normal equations come from and it mentions eigenspaces without ever defining them.
2.
▲
by
ziedaniel1
2y ago
What are some others?
3.
▲
by
ziedaniel1
2y ago
I did make sure to check before posting. Good point about the signed integer overflow, though!
4.
▲
by
ziedaniel1
2y ago
I used GCC and checked that it wasn't optimized out (which actually surprised me!)
5.
▲
by
ziedaniel1
2y ago
Very cool idea - but unless I'm missing something, this seems very slow. I just wrote a simple loop in C++ to sum up 0 to 2^30. With a single thread without any optimizations it runs in 1.7s on my laptop -- matching Bend's perform
6.
▲
by
ziedaniel1
3y ago
A couple details worth noting: - `repr` often outputs valid source code that evaluates to the object, including in the post's example: running `datetime.datetime(2023, 7, 20, 15, 30, 0, 123456)` would give you a `datetime.datetime` obj
7.
▲
by
ziedaniel1
3y ago
Do you have a source for that? I thought it was closer to 5pJ/byte.
8.
▲
by
ziedaniel1
4y ago
I enjoyed the easter eggs!
9.
▲
by
ziedaniel1
5y ago
(Yeah, I was not a TA then -- I took it under Paxos in Spring 2014 but only TA'd it after the switch to Raft)
10.
▲
by
ziedaniel1
5y ago
As someone who TA'd 6.824 (Distributed Systems) twice, I 100% agree. It's easier to halfway understand Raft than to halfway understand Paxos, but implementing a consensus algorithm correctly requires understanding it fully. Once y
11.
▲
by
ziedaniel1
5y ago
This sounds like you're describing energy-based models, not diffusion models.
12.
▲
by
ziedaniel1
7y ago
I think you misread slightly. > All of these algorithms take constant time, i.e., time independent of the input coefficients for any particular (n, c). This means that once you have chosen a particular n and c , the time no longer v
13.
▲
Notes on Contemporary Machine Learning for Physicists [pdf]
(sites.krieger.jhu.edu)
8 points
by
ziedaniel1
7y ago
|
0 comments
14.
▲
by
ziedaniel1
8y ago
Oh, good point, I didn't read what you wrote carefully enough.
15.
▲
by
ziedaniel1
8y ago
Actually, the illegal memory access would be undefined behavior, so it's fine for the compiler to assume that it's living in a world where the segfault never happens. Thus, it can optimize away the extra reads. If this weren'
16.
▲
by
ziedaniel1
9y ago
The center core is new, but the side boosters are both recycled. See https://en.m.wikipedia.org/wiki/List_of_Falcon_9_and_Falcon_...
17.
▲
by
ziedaniel1
9y ago
I enjoy MealSquares: http://mealsquares.com . A bit expensive, but fulfills many of the same objectives.
18.
▲
by
ziedaniel1
9y ago
The very same airport, in fact. They accidentally turned off auto-throttle and took far too long to react to the falling airspeed.
19.
▲
by
ziedaniel1
10y ago
I think you mixed up m/s and km/s. The speed of light is 300,000,000 m/s, so 30,000 m/s is only .0001c. At 1g, it actually takes a month to reach .1c. (Still, your point stands.)
20.
▲
by
ziedaniel1
10y ago
Wow, can I read more about the circum-planetary superconductor idea somewhere? I thought this sort of thing wouldn't work because superconductors lose superconductivity once currents get too high, as you mention.
21.
▲
by
ziedaniel1
10y ago
To get the key ideas behind many of these topics, you could try reading Evan Chen's Infinitely Large Napkin: http://www.mit.edu/~evanchen/napkin.html
22.
▲
The Napkin Project
(mit.edu)
1 points
by
ziedaniel1
10y ago
|
0 comments
23.
▲
by
ziedaniel1
10y ago
I believe you use timing differences, not parallax (it takes ~40 ms for gravitational waves to travel through Earth).
24.
▲
by
ziedaniel1
10y ago
Wasn't TSX only enabled on Xeons to begin with?
25.
▲
by
ziedaniel1
11y ago
That's assuming that they're independent, though, which is certainly false. I'm curious by how much.
26.
▲
by
ziedaniel1
11y ago
Great - sorry for the harsh words, I guess I've just come to expect people to screw up distributed systems :)
27.
▲
by
ziedaniel1
11y ago
"Due to the nature of Raft, there is a very small window (milliseconds) where a node has been disposed as leader, but has not yet changed its internal state. Therefore, even with the leader check in place, there is a very small window
28.
▲
by
ziedaniel1
11y ago
What's the biggest bottleneck for better forecasting: better observations, better models, or better supercomputers?
29.
▲
by
ziedaniel1
11y ago
This is really cool! However, I was somewhat disappointed that it only models a linearizable memory (each low-level operation atomically acts on the same global state). It would be great to teach people that they can't actually think
30.
▲
by
ziedaniel1
11y ago
The inability to edit or append to files is not really a fundamental limitation of this approach - it would just require some more bookkeeping. Reading back data, of course, is (by design) impossible.
More ›