Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vbarrielle
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
9 ms
·
1.
▲
by
vbarrielle
8d ago
Math problems are often stated in a way that makes it possible to automatically verify if a solution is correct. Which means a loop that speculates an approach (LLM and/or prompts), implements it (LLM), then checks (automated) can work
2.
▲
by
vbarrielle
12d ago
> Anyone taking a single look at the ARC-AGI "challenges" can see things a 5 year old could reasonably solve. Isn't that the goal of these challenges? Each release shows challenges that are very easy for humans, but are im
3.
▲
by
vbarrielle
20d ago
Since global warming I guess. When there's a heat wave, Norway is probably one of the worst places on hearth to be. You've got near constant sunlight, there's not much time at night to cool your house.
4.
▲
by
vbarrielle
28d ago
I guess they can always procrastinate tomorrow.
5.
▲
by
vbarrielle
3mo ago
The matrix multiplication is only deterministic for sparse-dense products under these settings: > torch.bmm() when called on sparse-dense CUDA tensors And it's not listed under the operations that raise an exception otherwise, so I&
6.
▲
by
vbarrielle
3mo ago
It may be an implementation detail, but in practice, if the only way to get a deterministic output is to run on the CPU, then it's not going to be usable.
7.
▲
by
vbarrielle
3mo ago
Chaitin's constant does not count? Depends on your definition of constructed, but contrary to "easy" normal numbers such as Champernowne's constant, it's not defined by its sequence of digits.
8.
▲
by
vbarrielle
3mo ago
This would be easier using the Champernowne constant ( https://en.wikipedia.org/wiki/Champernowne_constant ) which is guaranteed to be normal, not just conjectured.
9.
▲
by
vbarrielle
5mo ago
I thought fair use was decided on a case by case basis, and could not be guaranteed? If true, wouldn't that mean that in other cases it could be ruled differently?
10.
▲
by
vbarrielle
5mo ago
No but you can get it for free with a prescription.
11.
▲
by
vbarrielle
6mo ago
Sounds like it indeed. The balance was... interesting, a single tank could not win against a dozen cavemen.
12.
▲
by
vbarrielle
6mo ago
Openrouter is a startup, what's the indication it serves token at a profit? It could be serving them at a loss to show growth.
13.
▲
by
vbarrielle
6mo ago
> For example, in a variant of environment TR87, Opus 4.6 scores 0.0% with no harness and 97.1% with the Duke harness (12), yet in environment BP35, Opus 4.6 scores 0.0% under both configuration This is with a harness that has been desi
14.
▲
by
vbarrielle
6mo ago
No, APIs fall under copyright, but the Supreme Court found that Google's reimplementation of Java's API was falling under fair use. Fair use is decided case by case, one cannot use that decision as a precedent.
15.
▲
by
vbarrielle
6mo ago
Not quite in my opinion. The output of an LLM from a simple prompt falls into the public domain, but if you also give a copyrighted work as input, the mechanistic transformation performed will not alter the original license (same as encodin
16.
▲
by
vbarrielle
6mo ago
Well I'm implying that someone who's been reading a codebase for 10+ years is the worst person to claim an "independent reimplementation".
17.
▲
by
vbarrielle
6mo ago
There's a difference between "I've read a LGPL code once, maybe I could do something similar" and "I've been reading this LGPL code for 12 years and now I'm going to do exactly the same thing".
18.
▲
by
vbarrielle
6mo ago
Everyone writes as if he just fed the spec and tests to Claude Code. Ignoring for now that the tests are under LGPL as well, the commit history shows that this has been done with two weeks of steering Claude Code towards the desired output.
19.
▲
by
vbarrielle
6mo ago
Google vs Oracle ruled that APIs fall under copyright (the contrary was thought before). However, it was ruled that, in that specific case, fair use applied, because of interoperability concerns. That's the important part of this case:
20.
▲
by
vbarrielle
6mo ago
The test suite was also licensed under the LGPL. The reimplementation can be seen as a derivative work of the test suite, and thus should fall under the LGPL. This does not even mention the fact that the coding agent, AND the user steering
21.
▲
by
vbarrielle
7mo ago
Even the most permissive open source licenses such as MIT require attribution. Releasing as open source would therefore benefit the author through publicity. Bein able to say that you're the author of library X, used by megacorp Y with
22.
▲
by
vbarrielle
7mo ago
I'm in strong agreement with this. Even though I'd prefer winter time all year round, I would rather enjoy permanent summer time over switching twice a year. And I'm living in France, so my "winter time" is actually
23.
▲
by
vbarrielle
7mo ago
Unfortunately it needs push notifications to authorize online payments.
24.
▲
by
vbarrielle
7mo ago
TOTP not accepted, because the confirmation for payment must include the amount to be paid, which cannot be done under TOTP as far as I know.
25.
▲
by
vbarrielle
7mo ago
Not running, but in cycling we have power meters, and some workouts (eg 2 x 20' threshold) will definitely burn in the range of 800 calories in an hour. The energy measured by the power meter for this workout is 800 kJ for me (my thres
26.
▲
by
vbarrielle
7mo ago
I' m far from being an LLM enthusiast, but this is probably the right use case for this technology: conjectures which are hard to find, but then the proof can be checked with automated theorem provers. Isn't it what AlphaProof doe
27.
▲
by
vbarrielle
8mo ago
The idea is interesting, but I don't think this qualifies as a second factor, as it can be reduced to a factor you have to remember, so equivalent to a password. The second factor should be derived either from something you own, or som
28.
▲
by
vbarrielle
9mo ago
I don't think old publications will become open access, only new ones.
29.
▲
by
vbarrielle
10mo ago
But the approach here is "write new code in rust", not rewrite.
30.
▲
by
vbarrielle
10mo ago
Automated theorem provers are also built around backtracking, which is absent in LLMs.
More ›