Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ezwoodland
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
ezwoodland
1mo ago
How else would you define bias if not an offset from equality or zero mean? For example, the b in y=mx+b
2.
▲
by
ezwoodland
1mo ago
You can only do so in another framework that might itself have bugs. Lean is called that because the hope is the part that has to be correct by inspection ("the kernel") is small or "lean". The kernel does have bugs some
3.
▲
by
ezwoodland
2mo ago
Websites should be thought of as VMS and shouldn't be trying to reverse engineer host state.
4.
▲
by
ezwoodland
2mo ago
Sounds like a technical issue that is not better solved by remote devices doing age verification, but instead by fixing the already existing implementation.
5.
▲
by
ezwoodland
3mo ago
Depends on if the independent events are uncorrelated. For example, if they had to be quantized to a grid of length 1750ft and quantized sufficiently in time as well, it might be impossible to average out since the various data points provi
6.
▲
by
ezwoodland
3mo ago
> Pirating is easy... That reasoning is why companies would prefer it be more difficult.
7.
▲
by
ezwoodland
4mo ago
According to Wikipedia, git does that: https://en.wikipedia.org/wiki/Variable-length_quantity#Remov...
8.
▲
by
ezwoodland
5mo ago
> imagine a world where ... It already works like that. > customers never bother to submit their own T&C's so they're not fairly represented You can't. Not a question of bother. > if you don't, then don'
9.
▲
by
ezwoodland
5mo ago
What makes OFDM inherently worse at long range? Don't you just lengthen your symbols and use the extra frequency bins until you have tolerable losses?
10.
▲
by
ezwoodland
8mo ago
No? Why would it? In the negative case, it would say the idea doesn't pan out. In the positive case, it would mean that you can use just S instead of S and K when doing combinator reduction, but doesn't change that this kind of re
11.
▲
by
ezwoodland
8mo ago
That doesn't matter. You could imagine a system that accumulates two terms: (actual result, junk). Instead of deleting something it just adds it to the junk part of the pair. Maybe the junk part itself has computation which never ends,
12.
▲
by
ezwoodland
8mo ago
Something along the lines of reed-solomon codes could work for you: If you want to share your password with M family members such that you only need N to agree to recover the original: Split your password into ordered chunks. Make a polynom
13.
▲
by
ezwoodland
2y ago
I think the parsed c program is the DSL. You have to write a parser and compiler for the c-like source to the actual c code.