William_BB

6 ms·

61.
by William_BB 1y ago
Interesting. Are these models the SOTA in the options trading industry (e.g. MM) nowadays?
62.
by William_BB 1y ago
The original example was (paraphrasing) "rerunning 10-100 tests that take 1ms after each keystroke". Even with incremental builds, that surely does not sound plausible? I only mentioned C++ because that's my main working lang
63.
by William_BB 1y ago
There's no way this would work for any serious C++ codebase. Compile times alone make this impossible I'm also not sure how LLM could guess what the tests should be without having written all of the code, e.g. imagine writing code
64.
by William_BB 1y ago
What do you think about this but in C++ (e.g. with explicit constructors)? Has anyone had any experience with it? Did it succeed or fail?
65.
by William_BB 1y ago
In my experience, coursera/khan academy courses have never been able to compete with a rigorous university course. They're great resources when you need alternative explanations, but never stood up on their own. I think long lectu
66.
by William_BB 1y ago
The reason is probably complexity and the task at hand. In my experience, LLMs are great at small tasks (bash or python scripts); good at simple CRUD stuff (js, ts, html, css, python); good at prototyping; good at documentation; okay at wri
67.
by William_BB 1y ago
Thank you so much, this explains it well. I was initially afraid that the dispatch would be costly, but from what I understand it's (almost) zero cost after the first call. I only code for x86 with vectorclass library, so I never had t
68.
by William_BB 1y ago
Could you elaborate on the dynamic dispatching features a bit more? Is that for portability?
69.
by William_BB 1y ago
It's mathematically sound and the quantum primitives it uses are well understood. The limiting factor in practice, as with everything quantum, is noise. You are right -- we don't know for certain until it's implemented. I sup
70.
by William_BB 1y ago
As the poster above mentioned, it's widely accepted that Shor works. We simply don't have hardware to run the full version. The quantum papers on "factorization as optimization" are borderline scams though. I wouldn&#x2
71.
by William_BB 1y ago
A standard undergraduate quantum computing course should suffice. Most of them would follow Nielsen and Chuang's book.
72.
by William_BB 1y ago
It depends on what "working on those problems" means to you. If you want to work on those problems as a software engineer, that sounds like an achievable goal. To me, the interesting, fulfilling bits of building the next Google&#x
73.
by William_BB 1y ago
[flagged]
74.
by William_BB 1y ago
I meant practically usable NISQ
75.
by William_BB 1y ago
"When quantum happens in a few years" -- do you mean NISQ (i.e. VQA, QAOA) or actual fault tolerant quantum computing that can run Shor?
76.
by William_BB 1y ago
I take the following approach: - Stack by default - Unique ptr if needed on the heap - Shared ptr if needed to share ownership Although unique ptr is zero cost after make_unique(), I avoid polluting my heap unnecessarily. I've never be
77.
by William_BB 1y ago
My first thought was conditional branches inside the for loop based on the element as well. By any chance, do you know how hard it is for compilers to auto-vectorize something like this? I am generally not sure where the boundary is.
78.
by William_BB 1y ago
The standard says that "Copy elision is <...> one of the two allowed forms of optimization, alongside allocation elision and extension,(since C++14) that can change observable side-effects" I agree you have a valid point tho
79.
by William_BB 1y ago
Not complaining at all! I have just heard of other people facing the same issues and assumed that this must be a well-known problem. It might also just be template heavy projects -- maybe it works great otherwise. I don't have much exp
80.
by William_BB 1y ago
I used to be a CLion user. Unfortunately, it could not keep up with our large and heavily templated C++ codebase. Although CLion Nova with the new ReSharper engine improved things a lot, we found our custom clangd with emacs/vim/V
81.
by William_BB 1y ago
I enjoyed reading the article. I'm far from a Python expert, but as an observation, most of these features are actually just typing module features. In particular, I wasn't sold on Generics or Protocols as I would have just used d
82.
by William_BB 2y ago
E.g. `std::ranges::for_each`, where lambda captures a bunch of variables by reference. Like I would hope the compiler optimizes this to be the same as a regular loop. But can I be certain, when compared to a good old for loop?
83.
by William_BB 2y ago
Hm I get the memory safety part, but could you elaborate on the compromised VM part? I'm not sure I understand that.. Specifically I don't understand what you mean by VM here
84.
by William_BB 2y ago
Oh wow, I haven't thought about refcounts on mutexes
85.
by William_BB 2y ago
All the answers were good, but I think this explained it the best. Thank you
86.
by William_BB 2y ago
This was not a gotcha, sorry if it came across that way. It was a genuine question
87.
by William_BB 2y ago
Can someone explain this part: > What happens if multiple threads try to access / edit the same object at the same time? Imagine one thread is trying to add to a dict while another is trying to read from it. There are two options he