jimaway123

8 ms·

1.
by jimaway123 1mo ago
It's called inflation. If you helicopter money on people they will bid up the prices of everything that they need. We had an experiment with this just a few years ago.
2.
by jimaway123 1mo ago
7x not 390x
3.
by jimaway123 1mo ago
>>>The problem is that a reader should not do anything with the data that is read, which depends on its value, before validating the copy, by counter comparison. The description of the problem explicitly says that this is not happe
4.
by jimaway123 1mo ago
So you're saying the problem that this article is solving is just preventing the language from generating code that can possibly load some incorrect bytes from main memory, even though these incorrect bytes will in every case be ignore
5.
by jimaway123 1mo ago
From the article: >>>The Problem: Even if the reader detects that the data was modified and discards the copy before use, the act of copying the non-atomic data itself still triggers undefined behavior. While a sequence lock can de
6.
by jimaway123 2mo ago
There is a good proportion of the planet that will look at that and say "well we just needed to write bigger checks."
7.
by jimaway123 2mo ago
What do you mean? The FBI could know that this VPN ip visited ngrok and then the retailer website, but how would it know that that ip was associated with the specific GDID unless microsoft was tracking (timestamp,website,gdid) tuples?
8.
by jimaway123 2mo ago
Yes I can see it would be pretty fast, but the computation is defined at run time and its evaluation uses pointers to the various nodes of the computation graph. This limits what optimizations be applied (ie inlining, vectorization, reorde
9.
by jimaway123 2mo ago
Is anyone aware of a version of this focused on very speed sensitive, low-level incremental computation? Like perhaps a compiler that generated a kernel for doing an incremental computation on a static graph?
10.
by jimaway123 2mo ago
How do you consistently update a DAG, like you describe in your medium article, if the functions corresponding to the nodes in the graph are free to create new dependencies willy-nilly? It seems like this would have to be pretty restricted
11.
by jimaway123 2mo ago
Can anyone comment on the suitability of databases of any kind as the data source for running a "high frequency trading" backtest? The fact that the market data ticks are in a database doesn't seem that helpful, given that t
12.
by jimaway123 2mo ago
block statement (assignment) expression operator (post-increment) operator (dereference) variable expression variable I don't think this could possibly be a valid AST for &#
13.
by jimaway123 2mo ago
Does anyone know exactly what is going on here to cause this difference? I am extremely puzzled that the "beginner friendly" code is not at some point in the compilation pipeline in EXACTLY the same representation as the non-&quo