5,032 karma · joined February 8, 2012
I was previously a staff scientist at Forschungszentrum Jülich [1] and a postdoc at Lawrence Livermore National Lab [2] doing computational nuclear [3] and atomic physics on absolutely gargantuan computers.
[0] https://en.wikipedia.org/wiki/University_of_the_Virgin_Islands
[1] https://en.wikipedia.org/wiki/Forschungszentrum_J%C3%BClich
[2] https://en.wikipedia.org/wiki/Lawrence_Livermore_National_Laboratory
[3] https://en.wikipedia.org/wiki/Lattice_QCD
What I was addressing was whether this detector is big enough for a reliable discovery. In that case what you really want to constrain is the rate, such-and-such events per kilogram of xenon per year (the per-kilogram-of-xenon can be traded for a per-liter rate given the density of the xenon).
Then, at some point, they freeze their pipeline, "open the box", run the analysis on the real data, and report what they find. But they can only "open the box" once per exposure, after that you can worry that human bias can creep in.
The LZ collaboration is going to run their machine until at least 2030. They have almost no hope of making a meaningfully larger detector, no will you hear them suggest one. Their detector is already designed at such a scale that it contains a substantial fraction of all the needed xenon isotope available on Earth.
[1] https://news.wisc.edu/dark-matter-detection-receives-10-ton-...
Suppose you had an infinite universe that was filled with a cool gas of low uniform density. Then the gravitational field at any particular point would be 0, by Gauss' law.
But, if you wait a brief moment the gas will not stay uniform, because each atom of the gas will have some velocity. You'll observe fluctuations: places with small over-density and small under-density (compared to the average). The places with over-density will gravitate more than the average and places with under-density will gravitate less, and gravity will cause the gas to clump.
Wait a few billion years and some places will have amalgamated whole galaxies' worth of matter around them and other places will be empty.
I've been steadily more impressed, but the real startling moment was earlier this week, I could show that in a particular operation I had a bug (some identity wasn't satisfied) but I couldn't understand why. In one try Claude Code grokked my code, explained the problem to me (there were some dimension-dependent minus signs that needed to be computed), and fixed it.
<f, g> = ∫ f(ω)^* g(ω) dω
which does match the corresponding linear-algebra inner product if the vectors are over the complex numbers p . q = Σ_i p^*_i q_i
which guarantees that p.p ≥ 0 even for complex p (and does not change the only-real case).This seems like a great attempt. I would be worried about how much parsing and backtracking might be required to infer the infix precedence in a totally general system (like garden-path sentences[1]) or actually ambiguous parse trees (which is cured by adopting some rule like right precedence and parens, but what rule you pick makes some 'natural language' constructions work over others).
If you have Mathematica installed you can write CLI scripts and notebooks.