Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Gehinnn
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
31.
▲
by
Gehinnn
2y ago
You could say the same about art. Artists put lots of time and effort into creating unuseful things to inspire others. Just like here!
32.
▲
by
Gehinnn
2y ago
A nice property of monoids is associativity, which allows for some interesting incremental algorithms, e.g. by using balanced trees: If the fold of × on a list is computed in clever way, the fold of × on a list where one element is modified
33.
▲
by
Gehinnn
2y ago
A good abstraction shouldn't make its usage shorter, it should make the proof that the usage is correct shorter. This usually means the total amount of assumptions needed to prove everything correct is decreased. (when the code is not
34.
▲
by
Gehinnn
2y ago
> I think the primary change is that these debates were focused on producing diffs that humans read; now the debate is whether the algorithms can accomplish this result with no human involvement at all. The better the diff captures the i
35.
▲
by
Gehinnn
2y ago
I'd pay a lot per month if I wouldn't have to care which subscriptions I need and could just access everything. I wouldn't pay a lot for any particular service that I'd just use only once or twice per month. I only ever
36.
▲
by
Gehinnn
2y ago
I was referring to the press release article. I also looked at the paper now, and to me their presented proof looked more like a technicality than a new insight. If it's not solvable in polynomial time, how did nature solve it in a cou
37.
▲
by
Gehinnn
2y ago
I skimmed through the paper and couldn't make much sense of it. In particular, I don't understand how their results don't imply that human-level intelligence can't exist. After all, earth could be understood as solar pow
38.
▲
by
Gehinnn
2y ago
Basically the linked article argues like this: > That’s because cognition, or the ability to observe, learn and gain new insight, is incredibly hard to replicate through AI on the scale that it occurs in the human brain. (no other more s
39.
▲
by
Gehinnn
2y ago
Love this for searching in movie subtitles!
40.
▲
Let installed web applications be file handlers
(developer.chrome.com)
2 points
by
Gehinnn
2y ago
|
0 comments
41.
▲
by
Gehinnn
2y ago
I think it's quite often possible! Most of code acts as implication. Given this piece of data (of this shape), I can compute that. Or given I'm a valid object (constructor completed successfully), I can do this and that. However,
42.
▲
by
Gehinnn
2y ago
I think DRY should be more "Don't repeat assumptions". Or rather, don't assume the same thing in two different places, especially not implicitly. Avoiding code duplication mostly follows from that.
43.
▲
by
Gehinnn
3y ago
I thought this was about doing UI in rust, but it's just Javascript/react. Also, in the demo screenshot, the margins of the agent/you labels feel off.
44.
▲
by
Gehinnn
3y ago
Here's how we implemented the Myers diff algorithm in VS Code: https://www.youtube.com/live/yWy-0TNVsLg On top of the core algorithm, we have many heuristics to show much nicer differs in many cases.
45.
▲
by
Gehinnn
3y ago
Reading this article, I want the same now for js code that involves web-workers... How can I write code that involves a webworker in a way that I can simulate every possible CPU scheduling between the main thread in the webworker (given the
46.
▲
by
Gehinnn
3y ago
Would it be far fetched to say object oriented programming is inspired by nature/physics? And thus, "more natural" than, let's say, procedural programming. Animals can be modeled nicely with objects/classes. Physica
47.
▲
by
Gehinnn
3y ago
I'm pretty sure that you have either an undecidable problem or a non deterministic piece of code that sometimes computes some value, other times a different value, depending on how the threads are scheduled. Neither is good.
48.
▲
by
Gehinnn
3y ago
The most underrated insight about logarithms is that for almost all practical applications, log2(n) is smaller than 32. The difference between a O(1) and O(log n) algorithm is usually not that big!
49.
▲
by
Gehinnn
3y ago
I think there are different ceilings. And probably everyone has some spaces where they didn't reach their ceiling yet.
50.
▲
by
Gehinnn
3y ago
Personally I'm all against cars, but I don't see why these unexpected costs don't apply to public transport as well. The noise of trains also reduces the value of the properties next to the tracks.
51.
▲
by
Gehinnn
3y ago
Doesn't the free market regulate this?
52.
▲
by
Gehinnn
3y ago
I can also recommend https://www.worldtimebuddy.com/ It's surprising how much ads all these tools show though.
53.
▲
by
Gehinnn
3y ago
With dependency order you mean dependants before dependencies? (and dependencies lazily when they are requested again by the dependant) If you update dependencies before dependants, the dependant might not depend on all it's dependenci
54.
▲
by
Gehinnn
3y ago
I implemented the eager recomputation model for the observable utilities in vscode [1] and it quickly fell on my feet because of these glitches. In particular this is problematic if you have observable optional state that has inner observab
55.
▲
by
Gehinnn
3y ago
When processing "pi = 3", I'd rather have the error "cannot assign to constant" than "unexpected token =". Generally, whenever I write a parser+checker, I try to have a very relaxing parser and then all th
56.
▲
by
Gehinnn
3y ago
A tag system is actually a deterministic computational model https://en.m.wikipedia.org/wiki/Tag_system
57.
▲
by
Gehinnn
3y ago
That's not how you show lower bounds. The problem is function f that gets a list of words D and a word w of length n and returns a list of indices I where to split w such that each part is in D or "false". Cleary, I has lengt
58.
▲
by
Gehinnn
3y ago
I'd bet the last problem (if you can prove that N^2 is a lower bound for the last problem) is open or at least very hard. Showing lower bounds without oracles (where you can prove that the oracle has to be called a certain number of ti
59.
▲
by
Gehinnn
4y ago
Cannot you get extremely unlucky so that for one input all the PRNG seeds map into a subset of the 1/3 unhelpful random strings?
60.
▲
by
Gehinnn
4y ago
I'd say its less about writing defensively (protecting yourself against libraries who don't deliver what they promised) and more about users making stronger assumptions than what the library promised (eg assuming json string liter
More ›