Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
layer8
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
15 ms
·
451.
▲
by
layer8
2mo ago
They may be random, but are they secure?
452.
▲
by
layer8
2mo ago
How do you handle UI state vs. underlying data (model) state, and dependencies between them? By UI state, I mean things like scrollbar position and selection state. When displaying a scrollable and selectable list of items, then for example
453.
▲
by
layer8
2mo ago
As someone who hasn’t used the language, I’m curious about what the valuable lessons of Objective-C are that the programming industry is resisting learning.
454.
▲
by
layer8
2mo ago
Also, “honest reading” — without any context explaining why one would contemplate a dishonest reading.
455.
▲
by
layer8
2mo ago
It’s undeniable: https://i1.kwejk.pl/k/obrazki/2017/04/4785e864a82730b16d00fe...
456.
▲
by
layer8
2mo ago
That presentation is so hilarious and sad at the same time.
457.
▲
by
layer8
2mo ago
Why are you assuming that the boundaries are whole calendrical years? Clearly, I meant exactly between the precise moment 1000 years ago and the precise moment 3000 years ago. ;)
458.
▲
by
layer8
2mo ago
Trust in formal reasoning is necessarily always conditional. You have to start somewhere. The good thing about verified formal proofs is that the only way they can be in error is if the verifier is faulty. This drastically limits the possib
459.
▲
by
layer8
2mo ago
Knowing multiple languages, in particular less related or unrelated ones, is mentally enriching. If you only know a single language, you don’t know what you are missing in terms of diversity of thought and expression. Languages aren’t fungi
460.
▲
by
layer8
2mo ago
The longevity of a city is difficult to achieve as an engineer/architect/builder nowadays. One might have better chances as a scientist.
461.
▲
by
layer8
2mo ago
The order is alphabetical, not random. ;)
462.
▲
by
layer8
2mo ago
Less ambiguously: between 1000 and 3000 years ago. ;)
463.
▲
by
layer8
2mo ago
Not to excuse the site, but you should really be using an ad blocker that takes care of that. I see nothing, neither on mobile nor desktop.
464.
▲
by
layer8
2mo ago
Hot-swappable, lockable drive bays with individual LED indicators. Needing more SATA ports than PCs typically come with. Features like auto-shutdown on USP failure that work out of the box. NICs with more than 1 Gbps. Lower power usage.
465.
▲
by
layer8
2mo ago
I don't particularly like coffee, so it's not addictive for me as well. But neither are the energy drinks that I actually like. Conversely, there are people heavily addicted to coffee, whether you want to call that "bizzarely
466.
▲
by
layer8
2mo ago
I meant specifically the Monster drinks. Red Bull for example is closer to 2 € here. The cheapest Aldi energy drinks are 0.29 €.
467.
▲
by
layer8
2mo ago
Sugar-free energy drinks aren’t rare (at least here in Europe), and people are putting fat and sugar in their coffee as well.
468.
▲
by
layer8
2mo ago
$3-4 is a lot. They are 0.99 € here (tax included).
469.
▲
by
layer8
2mo ago
I mean, you could say the same thing about coffee.
470.
▲
by
layer8
2mo ago
While I disagree with the root comment, sentience, consciousness and reasoning ability seem largely orthogonal to me. It’s certainly worthwhile to consider sentience and consciousness in AI, but so is examining AI reasoning in its own right
471.
▲
by
layer8
2mo ago
Like a diver ascending from the depth? ;)
472.
▲
by
layer8
2mo ago
That’s not a counterexample to P != NP, it’s a proof that P = NP. You can’t prove that two sets are the same by counterexample. What you could do is dis prove P = NP by counterexample, by showing that some problem is in NP but not in P. At
473.
▲
by
layer8
2mo ago
If it’s an NP-complete [0] problem like SAT, as many NP problems are, then we are done, because all NP problems can be reduced to it (in polynomial time). [0] https://en.wikipedia.org/wiki/P_versus_NP_problem#NP-complet
474.
▲
by
layer8
2mo ago
Disprove, you mean.
475.
▲
by
layer8
2mo ago
I’m pretty sure “counterexample” is the wrong word here.
476.
▲
by
layer8
2mo ago
AI isn’t “supposed to be” anything (other than “intelligent”). It just turned out that LLMs have to be used in particular ways to be useful. Nobody planned or designed them to be that way. We all as users are put to do the job of discover
477.
▲
by
layer8
2mo ago
It’s not the same thing, in particular if you work in a dynamically-typed programming language, have mutable state, parallelism, and infinite loops. The Curry–Howard correspondence only applies in a limited sense to practical programs. That
478.
▲
by
layer8
2mo ago
The reason you can't always determine if a program is going to finish is due to the undecidability of the halting problem, which is equivalent to Gödel’s first incompleteness theorem (you can prove one from the other). But that's
479.
▲
by
layer8
2mo ago
As mentioned, what constitutes "hidden text" is not well-defined. Is #fffffe on #ffffff "hidden text"? Is text hidden behind an image or behind some other object "hidden text"? Is text outside the visible page
480.
▲
by
layer8
2mo ago
As the sibling comments illustrate, “hidden text” isn’t well-defined, and it has legitimate purposes that end users consciously make use of. The AI needs access to it, for one because the user might actually want the AI to perform actions o
More ›