daniel-thompson
daniel-thompson on Hacker News
i was a casual reader of 538 back in the day. his substack feels pretty similar, if smaller in scope.
The article outlines some interesting ways to evade this problem. What's the latest thinking on robustly addressing it, e.g. are there any approaches for executing inference on a tf or pytorch model from within a golang process, no sidecar required?
"People are generally better persuaded by the reasons which they have themselves discovered than by those which have come into the mind of others."
- Blaise Pascal, 1670
> [softbank's offer to rescue wework] is the result of Neumann’s holdup power: Prior to the deal, Neumann is still the company’s controlling shareholder, and he could just say no to a deal that he didn’t like. That might completely evaporate his own wealth, but it would evaporate a whole lot more of SoftBank’s, and it kind of looks like SoftBank blinked first: In effect, the price of Neumann allowing SoftBank to rescue WeWork was that SoftBank had to hand Neumann a billion dollars for himself
annotated reviews of high-level chess games: - https://www.youtube.com/@ChessNetwork
blender tutorials: - https://www.youtube.com/@blenderguru
To minimize allocations, call (*Result).WriteTo instead of (*Result).Bytes. WriteTo streams the response directly to an io.Writer such as a file or HTTP response.> Use context Values only for request-scoped data that transits processes and APIs, not for passing optional parameters to functions.
- Sag A* has a mass of ~4,000,000 times the sun, and an event horizon of approximately 12,000,000 km (0.08 AU). This is just the event horizon; Sag A*'s accretion disk has a diameter of about 150,000,000,000 km (1000 AU). So your intuition would certainly be right about Sag A* - there is a huge disk of gas and other junk you'd be flying through.
- This object has a mass of at most ~12 times the sun, and (if it's a black hole) an event horizon of approximately 35 km. The paper doesn't say anything about an accretion disk given that it's exploring the idea that the object is not a black hole. Regardless, a star orbiting at 1.4 AU would probably clear out everything in the immediate neighborhood.
The distance between objects in this system 1.4 AU, which is _incredibly_ close.
> O(n^2) is the sweet spot of badly scaling algorithms: fast enough to make it into production, but slow enough to make things fall down once it gets there.
https://randomascii.wordpress.com/2021/02/16/arranging-invis...
When I started at university in a technical major, it was a real kick in the teeth. The material was substantially more difficult, but the hardest part for me - and the biggest piece of learning - was the realization that I had to study consistently and be purposeful about managing my time in a way I never really had to before I got there.
My grades freshman year were abysmal. But they also helped me internalize that I needed to buckle down and put in the work. I'm glad that that happened in a relatively forgiving environment like school, instead of in the workplace.
For processing speed, Ms are fast but I agree not anywhere near a top Nvdia chip.
For memory size, the memory on an M chip can be used as graphics memory, so a person could get an M2 today with 128GB of graphics memory for ~ $5k. Not bad considering an Nvidia chip approaching that memory size is several times that much.