chombier

5 ms·

1.
by chombier 10d ago
That of the underlying, hypothetical universal brain topology?
2.
by chombier 18d ago
Talk starts as 6:01:10
3.
by chombier 3mo ago
IIRC there's a fairly natural positive definite quadratic form on GA (used as the canonical norm) that takes the scalar part of the geometric product of a multi-vector and its reverse. On the other hand, there's the k-th exterior
4.
by chombier 3mo ago
> pull out Hodge Duals every time you want to do something that involves the metric, but I'm also unconvinced that geometric algebra is the answer here. I don't know, I recently tried to work out how the metric on vectors/
5.
by chombier 3mo ago
If you ever wondered how to write a programming language, this is probably the best resource to get started (and then of course Crafting Interpreters). See also part 2 https://norvig.com/lispy2.html
6.
by chombier 3mo ago
Gimbal lock?
7.
by chombier 4mo ago
I was a bit curious to learn what the differences are between this and the actor model, and I found this lobste.rs discussion to be helpful: https://lobste.rs/s/gsjskz/behavior_oriented_concurrency_for > In BoC
8.
by chombier 9mo ago
Apart from installation problems/crash issues, do you have some feedback about type checking with ty vs. pyrefly? Which is stricter, soundness issues, etc? Both are rust/open-source/new/fast so it's difficult to un
9.
by chombier 9mo ago
For inextensible cloth there's also "Efficient simulation of inextensible cloth" [0] that is particularly clever and efficient [0] https://dl.acm.org/doi/10.1145/1276377.1276438
10.
by chombier 10mo ago
Also check out Jean Gallier's notes (available online) https://www.cis.upenn.edu/~jean/gbooks/manif.html
11.
by chombier 10mo ago
Nice! It would be interesting to visualize the total momentum vector, IIRC Verlet being symplectic should be good at preserving symmetries, whereas RK4 is good at conserving energy.
12.
by chombier 1y ago
I've been programming in c++ for 25 years (15 professionally) and I really don't see any reason to keep using it apart from dealing with legacy codebases. Most arguments in the article boil down to "c++ has the reputation of
13.
by chombier 1y ago
Thanks, I scanned through all the comments/links but this is the actual resource one wants to read to get familiar with Backpack.
14.
by chombier 1y ago
my tl;dr: after reading the article: - two 64-bits words representation - fixed, 32 bits length - short strings (<12 bytes) are stored in-place - long strings store a 4 byte prefix in-place + pointer to the rest - two bits are used as fl
15.
by chombier 1y ago
That was a nice read, thanks.
16.
by chombier 1y ago
A quick comparison of the two languages would be interesting, in case anyone has experience with both.
17.
by chombier 1y ago
The PLDI talk is also available: https://www.youtube.com/watch?v=CJi_Fcs4bak
18.
by chombier 1y ago
pandoc has a reveal.js backend which I use it to build my slides from markdown (with a few ad-hoc inline css tweaks)
19.
by chombier 1y ago
What I found hard with Nix is the sheer amount of things I had to get familiar with before it started to really click: - nix, the command-line tool - nix, the language - nixpkgs with the general API/idioms (overriding, overlays) - indi
20.
by chombier 2y ago
Yes, but from the canonical form of rotation matrices [1] I would expect such matrices to be represented as a sum of bi-vectors/rotors, which should take the same amount of data? [1] https://en.wikipedia.org/wiki/O
21.
by chombier 2y ago
Geometric Algebra supporters keep advertising that rotors are great since they work in any dimension, which makes me wonder: would an arbitrary n-dimensional SVD-like decomposition benefit from using rotors instead of rotation matrices, and
22.
by chombier 2y ago
> and also faster than it takes me to verify the answer given by the machine. I always thought there was a kind of NP-flavor to the problems for which LLMs-like AI are helpful in practice, in the sense that solving the problem may be har
23.
by chombier 2y ago
Not exactly the same: `x` is given a polymorphic type (in F) in Haskell (restricted to values in ML) whereas the unannotated let-over-lambda will give `x`a monomorphic type.
24.
by chombier 2y ago
There is a kind of "do notation" in OCaml with binding operators [1] (let*) for monads and (let+) for applicatives that is actually quite pleasant in practice. [1] https://ocaml.org/manual/5.2/bindingops.
25.
by chombier 2y ago
Besides, if you still want to skip learning there are escape hatches like Rc<RefCell> but these hint pretty strongly (e.g. clones everywhere) that something might be wrong somewhere.
26.
by chombier 2y ago
> Of course you have to internalise the rules of a borrow checker This is generally a good thing: the more you internalise the logic of borrow checking, the earlier you start thinking about "who owns what" instead of deferring
27.
by chombier 2y ago
I think this is because `mutable` qualifies the call operator of the lambda (like a reverse const qualifier) so by-value captures are effectively const during the call unless the lambda is marked `mutable`. References themselves are alway
28.
by chombier 2y ago
> >Distances are canonically defined in the space of rotations > I am sorry, but this is simply not true. It is true, there is a canonical choice given by the bi-invariant Riemannian metric on compact Lie groups, such as rotation
29.
by chombier 2y ago
> Rotations don't commute, so the concept of average as we understand it doesn't normally apply to them. It does apply, considering that the Euclidean mean minimizes the sum of squared lengths to samples there's a fairly o
30.
by chombier 2y ago
Funny, I was there last Thursday and our guide said "supposed to finish in 2026, more like 2035 if you ask me!"

More ›