thesz

16 ms·

271.
by thesz 1y ago
It is not indicated anywhere that this particular motor is more efficient than older ones in terms of the electric force conversion. This new motor is more powerful, that's it. Nothing was said about cooling or voltage requirements. Th
272.
by thesz 1y ago
Tesla Model Y's battery is 771 kg. The motor in Model Y weights about 45 kg, about three times as much as the motor in the article. By reducing dual motor configuration weight from 90 kg to 28 kg, we reduce total powertrain weight by 7
273.
by thesz 1y ago
I am professional database developer. We do not do what you are thinking we are doing. ;)
274.
by thesz 1y ago
"In general, neither can ensure at compile time that an index only known at runtime is in bounds, even if the bounds themselves are statically known." I remember being able to use telescopes [1] in Haskell long time ago, around 20
275.
by thesz 1y ago
I replied to unwarranted (to my eye) call that Fil-C is significantly slower than plain C. Fil-C has its drawbacks, but they should be described carefully, just with any technology.
276.
by thesz 1y ago
> best case scenario since there is very little memory management involved and runtime is dominated by computation in tight loops. This describes most C programs and many, if not most, C++ programs. Basically, this is how C/
277.
by thesz 1y ago
From the topic starter: "I've posted a graph showing nearly 9000 microbenchmarks of Fil-C vs. clang on cryptographic software (each run pinned to 1 core on the same Zen 4). Typically code compiled with Fil-C takes between 1x and 4
278.
by thesz 1y ago
Chip manufacturing is extremely time consuming, especially when we are talking about masks for lithography. The rights on masks for chips and their parts (IPs) belong to companies. And one definitely does not want these masks to be sold dur
279.
by thesz 1y ago
What does EBS mean? It is used in first line of the text but no explanation was given.
280.
by thesz 1y ago
> I can't imagine building something like a graphics framework without some subtyping. Let me introduce you to Fudgets, an I/O and GUI framework for Haskell: https://en.wikipedia.org/wiki/Fudgets T
281.
by thesz 1y ago
> This is interesting, but techniques like CDCL seem to only ever find any one valuation that makes a proposition true. Most, if not all, current SAT solvers are incremental. They allow you to add clauses on the fly. So, when you
282.
by thesz 1y ago
> You give the AI a set of requirements, ie. tests that need to pass, and then let it code whatever way it needs to in order to fulfill those requirements. SQLite has tests-lines-to-code-lines ratio above 1000 (yes, 1000 lines o
283.
by thesz 1y ago
Quake's sqrt approximation is not trivial and is not common. [1] https://www.reddit.com/r/programming/comments/oc9qj1/copilot...
284.
by thesz 1y ago
> copyright shouldn't even exist to begin with. You then get trade secretes and guilds. Hardly an improvement.
285.
by thesz 1y ago
One can train model with copyrighted code as it is fair use, fair enough. Are there any rulings about use of code generated by model trained on copyrighted code? I believe distinction is clear.
286.
by thesz 1y ago
Can it be that transformer-based solutions come from the well-funded organizations that can spend vast amount of money on training expensive (O(n^3)) models? Are there any papers that compare predictive power against compute needed?
287.
by thesz 1y ago
No neural protein structure prediction papers I read have compared transformers to SAT solvers. As if this approach [1] does not exist. [1] https://pmc.ncbi.nlm.nih.gov/articles/PMC7197060/
288.
by thesz 1y ago
And the (possible) origin of Skibidi (by Little Big): https://www.youtube.com/watch?v=mDFBTdToRmw
289.
by thesz 1y ago
The list of papers miss this one from 1970: https://personal.cis.strath.ac.uk/conor.mcbride/FVMcB-PhD.pd... This is thesis of Frederick McBride, father of Connor McBride, who does significant work in dependent types&#x
290.
by thesz 1y ago
> while I don't see an easy way to avoid big locks with COLA Do not modify arrays in-place, create new arrays instead. This way you can have multiple readers as the data pretty much read-only, no write locks and, again, cach
291.
by thesz 1y ago
B+-tree is an optimization for slightly faster sequential read, when leafs are organized into a list. LSM allow for very compact data representation because most levels of the tree do not change much through time, and this is what we are ta
292.
by thesz 1y ago
You may not encounter a situation where cache oblivious structure is needed, but the knowledge that some algorithms are cache oblivious can help. For example, if you represent a set of values as an ordered array, you can perform many set op
293.
by thesz 1y ago
We are talking about cache friendliness here, including compact data representation. B-trees algorithm requires leaf nodes to be filled up to some prespecified fill factor, usually from 50% to 70%. This is not compact by any measures. Both
294.
by thesz 1y ago
One would be better off implementing cache-oblivious lookahead array [1] or even log-structured merge trees. [1] https://www3.cs.stonybrook.edu/~bender/newpub/BenderFaFi07.p... Both structures exploit the fact tha
295.
by thesz 1y ago
> Highly unconstrained extensibility. While this is a goal of RISC-V, it is also a recipe for a fragmented, incompatible ecosystem and will have to be managed with extreme care. This is taken straight from the ISA specification.
296.
by thesz 1y ago
> Without AMD64, I firmly believe eventually Itanium would have been the new world no matter what. VLIW is not binary forward- or cross-implementation-compatible. If MODEL1 has 2 instruction per block and its successor MODEL2 has
297.
by thesz 1y ago
> It ‘just’ needs a state for every possible random color between. You can use skipgrams - prefixes with holes in them. Sparse Non-negative Matrix Language Model [1] uses them with great success. [1] https://aclanthology.org&#
298.
by thesz 1y ago
> This paper addresses the challenge by asking: how can we trade off more compute for less data? Autoregressive models are not matched by compute and this is the major drawback. There is evidence that training RNN models that
299.
by thesz 1y ago
>The amount of people actually able to meaningfully read code, somehow identify what was so incredible it should be analysed despite being unfamiliar with the code base, maintain a list of their own likely error and self review is s
300.
by thesz 1y ago
> Have you ever contributed to a very large project like LLVM? Oh, I did. Here's one: https://github.com/mariadb-corporation/mariadb-columnstore-e... > I would say clearly not from the comment.

More ›