Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
stymaar
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
26 ms
·
601.
▲
by
stymaar
4y ago
> Did you realise that Chornobyl will not be rebuilt in our lifetime? What are you talking about exactly: the destroyed reactor #4 won't be rebuilt but I don't think it's relevant, but the other reactors were still functio
602.
▲
by
stymaar
4y ago
Do you realise that Hiroshima and Nagasaki were rebuilt right after?
603.
▲
by
stymaar
4y ago
Same here! (And I also remember playing with MS paint on my dad's work computer)
604.
▲
by
stymaar
4y ago
> Hence, I'm working on http://diffudle.com/ which is a mix of Wheel Of Fortune + Stable Diffusion + Wordle. I Can't figure it out but feels to me like its lacking something. That's awesome, I love it!
605.
▲
Diffudle: Stable Diffusion Meets Wordle
(diffudle.com)
2 points
by
stymaar
4y ago
|
0 comments
606.
▲
by
stymaar
4y ago
> For example, I feel it's just too easy to call `.clone()` to store an owned value instead of storing a reference and introducing the correct lifetime constraints. There's three levels when on the ownership ladder: 1. Taking o
607.
▲
by
stymaar
5y ago
Atlasian, really?
608.
▲
by
stymaar
5y ago
The power (in W) isn't the relevant value when talking about batteries, it's the stored energy (in Wh) that matters (it's the opposite for dam storage, where energy is plentiful but power is limited). Just do the math and che
609.
▲
by
stymaar
5y ago
Casual skydiver with no piloting experience here. > > skydiving rig > Is this because he is already a skydiver and/or was going paragliding (is this the same rig? Another thing I don't know). Would it make sense that thi
610.
▲
This is #golang's left-pad moment
(twitter.com)
2 points
by
stymaar
10y ago
|
0 comments
611.
▲
by
stymaar
10y ago
I totally agree with this statement, but here we're talking about 0.5 year of planning ! Planning is important , and cautiously thinking about your features before diving in can save you weeks later on. But spending 6 month in a tun
612.
▲
by
stymaar
10y ago
> I went full waterfall on it, the spec is 266 pages long and took half a year just to write. Why would you write a ~9k “loc” long spec over 6 month instead of coding it directly ? The only reason I can think of, is if you want to out-so
613.
▲
by
stymaar
10y ago
Just add a newline inbetween : > like > this
614.
▲
by
stymaar
10y ago
Actually it doesn't: what if the given sequence exists but cannot be expressed with words ? (This is exactly the same thing than «a real number that can't ne expressed with words» which is what I'm trying to demonstrate not t
615.
▲
by
stymaar
10y ago
Oh, you're right. For that I would need to explicit the construction of the sequence n0, n1, … but that's impossible : if I can find such sequence, my proof holds but at the same time such sequence shows that the set is countable
616.
▲
by
stymaar
10y ago
Why do you need to compute the n-th decimal of a number for this proof to work ? let Ω be a Chaitin Omega number it's decimal are non-computable, yet for every x, Ω + x is a perfectly valid number. Then `floor(Ω.10^(n))-10.floor(Ω.1
617.
▲
by
stymaar
10y ago
> How do you describe the difference between two successive real numbers? There is no such things as «two successive real numbers».
618.
▲
by
stymaar
10y ago
> I'll try to physicalize countability. > Start counting the naturals: 1, 2, 3, ... > At future timelike infinity you'll reach infinity. > Now for the reals. Your goal is to step from 0 to 1, by way of 0.1, 0.01, and s
619.
▲
by
stymaar
10y ago
> Consider that great big set. It's still countable. You didn't prove that statement, and actually Cantor's diagonal arguments [1] proves you wrong: Consider the set of «all real numbers which you can actually specify IN
620.
▲
by
stymaar
10y ago
It was in 2015 and early 2016, before version 1.0. You're right that's an important piece of context I should have added.
621.
▲
by
stymaar
10y ago
In my experience, the main benefit of influxdb are its built-in functions (percentiles, integration/derivation, etc.) but its scaling ability is over-emphazised : in my last company my coworkers have had issues exceeding 30k insertions
622.
▲
by
stymaar
10y ago
> It lacks access control for class properties/methods, I wouldn't call that powerful. You mean `private` and such ? Well JavaScript don't support taht either yet, and flow is a type-system for JavaScript, it's not a
623.
▲
by
stymaar
10y ago
> And the React ecosystem tends to either lack typings or provide poor/broken typings. React integrates really well with flow[1] (which is not surprising because they're both developed at Facebook) and in my experience flow
624.
▲
by
stymaar
10y ago
Surprisingly enough, Java is a native language in some parts of the embeded world (see smart cards for instance, but not only [1]). [1]: https://en.m.wikipedia.org/wiki/Java_processor
625.
▲
by
stymaar
10y ago
> Wait, isn't there a million of these already? If there is a million of them, there must be business here, and if an entrepreneur thinks he can do it better than his average competitor, he should definetly go ahead. A company doesn
626.
▲
by
stymaar
10y ago
Do we know if this fonction has a limit different from 100 ? I mean, is there a number 'x'<100 where, for any number 'n' the percentage of all integer having a divisor below 'n' is always < x ?
627.
▲
by
stymaar
10y ago
> the software updater should never ask me "Please restart the computer to begin using your updated software" again. Is it still a thing ? I've been using Linux Mint (which is based on Ubuntu for updates) and I haven'
628.
▲
by
stymaar
10y ago
> So why do have to manually mutex or semaphore your threads? This is not a type system with concurrency capabilities is meant for. You don't have to use mutex ! The Rust type system has two traits to ensure thread-safety : Send a
629.
▲
by
stymaar
10y ago
> The only two languages I know that offer data-race-free multi-threading are Pony[2] and Rust. I should have added «with shared memory», otherwise any language that purely rely on message-passing is also free from data-races (even JavaS
630.
▲
by
stymaar
10y ago
For the record, Go has no static thread safety guaranty. It's easy to write a data-race in Go (and it occurs frequently). Fortunately the go compiler has a tool that help detecting data-races[1]. The only two languages I know that offe
More ›