emil-lp

4 ms·

31.
by emil-lp 1mo ago
This article is the tldr.
32.
by emil-lp 1mo ago
If they have zero-retention, then it is not possible. So what they are saying is that they don't have zero retention.
33.
by emil-lp 1mo ago
That's a good question. It is able to contribute code, but maybe not good code. It's the same in math: it's able to solve problems, but not necessarily in a good way with a human readable code. Math papers are a lot like so
34.
by emil-lp 1mo ago
> Surely it's less effort to just make the bed? It's not about the bed. People are addicted to generating now. Slopoholics the whole bunch of them.
35.
by emil-lp 1mo ago
I have a house I like, a car I like, a career I like. Nothing in this post resonates with me. Take control of your life and be satisfied with what you have. Put away your phone and pick up a book. Listen to a record. Watch a movie. Yes, peo
36.
by emil-lp 1mo ago
What's with the title? It's a Typescript-to-circuit converter/transpiler/compiler. Why not just "Build a circuit in Typescript" ?
37.
by emil-lp 1mo ago
> The false positive rate for Pangram 4 is something like one in 24,000. First of all: says them. . Do you think they might have an incentive to boost their numbers? Second, this is on existing text , which might be in their training d
38.
by emil-lp 1mo ago
You mean why not say £ 1MM?
39.
by emil-lp 1mo ago
Says anonymous internet user with a 10 minutes old account.
40.
by emil-lp 1mo ago
> Lying is a core part of communicating mathematics. We lie to kindergarteners when explaining fractions. We lie to fourth graders when approaching limits... Hard disagree. Lying is with intention to deceive. Teaching is simplifying wi
41.
by emil-lp 1mo ago
Say that you add and remove elements. Perhaps your data structure runs amortized constant time. However, if the GC is, say, quadratic time, then this breaks the linearity of your algorithm. This was indeed something that happened in recent
42.
by emil-lp 1mo ago
You are assuming GC runs in linear time.
43.
by emil-lp 1mo ago
Cannot cite Chesterton's fence too often. In the matter of reforming things, as distinct from deforming them, there is one plain and simple principle; a principle which will probably be called a paradox. There exists in such a case a c
44.
by emil-lp 1mo ago
They forgot to include GC overhead.
45.
by emil-lp 2mo ago
> This should not be surprising at all. Every new students spends tiny fractions of time learning knowledge that took many lifetimes to discover. This argument is exactly why we should not anthropomorphise models. You are comparing the w
46.
by emil-lp 2mo ago
You only have to prove the formalization of the theorem statement . The formalized statement is guaranteed to be true if Lean says so. There will always be a leap from the real world to the formal world.
47.
by emil-lp 2mo ago
Why not Markdown - pandoc - epub/pdf?
48.
by emil-lp 2mo ago
I don't know if it's weird. Is there an actual publication to cite? Or just a GitHub repo?
49.
by emil-lp 2mo ago
+1 for Strang.
50.
by emil-lp 2mo ago
Previously on Hacker News: Linear Algebra Done Right 58 points, July 2023, 4 comments https://news.ycombinator.com/item?id=36576114 Linear Algebra Done Right – 4th Edition , 631 points, Oct 2023, 294 comments https:&#x
51.
by emil-lp 2mo ago
> I really think ebikes, and things like this, would have a much better reputation if they really only supported up to maybe 10 km/h or 6 mph. Where is it ebikes don't have a good reputation? Where I'm living, they have
52.
by emil-lp 2mo ago
The foundation of math is (mostly) ZFC.
53.
by emil-lp 2mo ago
Related: Alzheimer's disease mortality among taxi and ambulance drivers (2024) 229 points, 4 months ago, 137 comments https://news.ycombinator.com/item?id=47559481 --- Taxi drivers offer a clue to Alzheimer's risk
54.
by emil-lp 2mo ago
I'm not particularly triggered, I didn't downvote you, if that's what you think. This is a platform to discuss all things related to tech. The suggestion that the OP discards their old tablet seems not in the true hacker spir
55.
by emil-lp 2mo ago
Why didn't you write that comment on a piece of paper instead?
56.
by emil-lp 2mo ago
It depends on F, but usually, if F is like 2^n, then a single F(i) for a too large i, is slower than computing F(j) for all j < i. This is illustrated by the fact that there are more leaves in a complete binary tree than all the other no
57.
by emil-lp 2mo ago
A small tip: if you want to do this trick, with an exponential F, you probably want a linear search rather than a binary search. If your k << N then F(N/2) is going to eat up all of the running time of ΣF(i).
58.
by emil-lp 2mo ago
Precisely! The reason I mentioned trees and forests are because they are probably more familiar. The Bipartite graph class is also a bit silly in this case, since it's by definition the 2-colorable graphs: bipartite, or 2-partite are t
59.
by emil-lp 2mo ago
For those not familiar: K-Coloring is the property that a graph can be colored with k colors such that no two neighboring nodes get the same color. The K-Coloring problem is a decision problem, ie a yes/no question. The chromatic numbe
60.
by emil-lp 2mo ago
You don't understand the statement. A bit of mathematical maturity is needed, sometimes, to parse a theorem statement. In any finite set of points, either there is a line hitting all points, or there is a line hitting exactly 2 points.

More ›