Readit News logoReadit News
yccs27 commented on Wisconsin communities signed secrecy deals for billion-dollar data centers   wpr.org/news/4-wisconsin-... · Posted by u/sseagull
sneak · 11 days ago
How is that predation if the people in that city democratically elected the mayor who made that choice? Isn’t that representative democracy decisionmaking working as intended?
yccs27 · 11 days ago
It‘s preying on the city‘s desperation to get a cash payout, to get space and utilities worth much more. Facebook abuses its market power to pit city governments against each other, while the cities don‘t have many alternatives.
yccs27 commented on Are two heads better than one?   eieio.games/blog/two-head... · Posted by u/evakhoury
maxbond · a month ago
I think it is different in the continuous case though, because you can average two (reasonably accurate) chronometers and get a better measurement. But we can't average true and false, at least not in the context of this problem definition.

But the chronometers are will sync with each other if you don't store them apart, which would result correlated noise that an average won't fix.

yccs27 · a month ago
The saying probably assumes that each chronometer has a certain small probability of malfunctioning, resulting in a significant error (basically a fat-tailed error distribution). With three chronometers, you can use a robust estimator of the true value (consensus value or median). With two, there's no robust estimator and if you use the mean, you have twice the probability of being significantly wrong (though only by half as much).
yccs27 commented on Show HN: Cachekit – High performance caching policies library in Rust   github.com/OxidizeLabs/ca... · Posted by u/failsafe
virtualritz · a month ago
Should be checked against official Rust API naming guidelines. LrukCache, not LRUKCache etc.

https://rust-lang.github.io/api-guidelines/naming.html#casin...

yccs27 · a month ago
Thanks for the link, nice to see the informal conventions spelled out like this!
yccs27 commented on The chess bot on Delta Air Lines will destroy you (2024) [video]   youtube.com/watch?v=c0mLh... · Posted by u/cjaackie
Disparallel · a month ago
Getting more thinking time tends to give surprisingly small improvements to playing strength. For a classical alpha-beta search based engine, for a given ply (turn) you might have ~20 moves to consider each depth of the search tree. If you're trying to brute force search deeper, a 10x increase in compute time or power doesn't even let you search an extra ply.

Elo gains for engines tend to come from better evaluation, better pruning, and better search heuristics. That's not to say that longer search time or a stronger CPU doesn't help, it just doesn't magically make a weak engine into a strong engine.

yccs27 · a month ago
True, although better pruning can massively lower the effective branching ratio compared to pure alpha-beta, making the algorithm benefit more from longer search time again (which is why pruning is so important).
yccs27 commented on Looking for flagged discussions on HN? See what's active   news.ycombinator.com/acti... · Posted by u/onemoresoop
Retr0id · a month ago
What does "flagged" mean in this context?
yccs27 · a month ago
Users with enough karma can "flag" posts and comments, which a) calls for moderator attention and b) decreases ranking. It's meant for off-topic/inflammatory/low-quality submissions.
yccs27 commented on Some Junk Theorems in Lean   github.com/James-Hanson/j... · Posted by u/saithound
akoboldfrying · a month ago
Thanks.

> If you find that you're depending on a junk value in a way that's incompatible with what you wanted to prove

This is the part I'm struggling with. How would you actually know/realise that you were doing this? It seems like "the mathlib way" you describe is choosing to rely on programmer discipline for something that could be enforced automatically.

My fear is that relying on the junk values of functions (values where their "proper" partial counterparts are not defined) is somehow unsound (could lead to proving something untrue). But perhaps my intuition is off here? If so, I think the specific junk values chosen must not matter at all -- e.g., having sqrt return 42 for negative x values should work just as well, am I right?

yccs27 · a month ago
It is enforced automatically for most purposes: If you're writing a proof involving e.g. the sqrt function, you want to use theorems about it, e.g. that (sqrt(x))^2 = x. Almost all of those theorems have x>=0 as a precondition, so you do need to prove it when it matters.
yccs27 commented on Inverse Parentheses   kellett.im/a/inverse-pare... · Posted by u/mighty-fine
TrianguloY · 2 months ago
Based on this comment (https://news.ycombinator.com/item?id=46352389), I think I understood the missing first paragraph:

If you have the expression 1+2*3 you have three elements with two operands. You need to choose a rule to pick one of them first.

In mathematics, the rule is "*/ then +-" and then from left to right. This means that usually first you do 2*3, then 1+.

But what if you do want to make 1+2 first?

There is another alternative, parenthesis. Those mean "do the thing inside first" so (1+2)*3 changes the precedence and now you do 1+2 first, then *3

The post is asking: with parenthesis you can increase the precedence of operations. What if you could decrease it?

Let's use «» as another operand (the blog uses parenthesis, but that makes it really confusing) this operand means "do the thing inside last". So the expression 1+«2*3» means "do 1+ first, then 2*3.

The issue is...this doesn't make sense, what the blog is really saying is to reduce the precedence of operators. Think the expression 1+2«*»3 or 1+2(*)3 and now the rule is "the parenthesized operators have one precedence less" so 1+2(*)3=(1+2)*3

yccs27 · 2 months ago
Thanks, writing it as 1+2(*)3 made it click for me.

Reminds me of the '$' operator in Haskell - it lowers the precedence of function application, basically being an opening parenthesis that's implicitly closed at the end of the line.

yccs27 commented on Thoughts on Go vs. Rust vs. Zig   sinclairtarget.com/blog/2... · Posted by u/yurivish
tapirl · 2 months ago
> Rust can also do arena allocations, and there is an allocator concept in Rust, too.

Just a pure question: Is Rust allocator global? (Will all heap allocations use the same allocator?)

yccs27 · 2 months ago
No. There is a global allocator which is used by default, but all the stdlib functions that allocate memory have a version which allows you to pass in a custom allocator. These functions are still "unstable" though, so they can currently only be used with development builds of the compiler.
yccs27 commented on Ruby Symbols   tech.stonecharioteer.com/... · Posted by u/stonecharioteer
yccs27 · 3 months ago
The article is a bit confusing, but I like the concept behind symbols: Basically a way to distinguish identifier names (chosen by the programmer) from user-facing strings.

The distinction between is one I've mentally adopted in other languages like Python as well. For personal projects I like to use single quotes for 'symbols' and double quotes for "strings", e.g.:

    add_label(text="Hello World!", align='center')
Does anyone else do something similar?

yccs27 commented on /dev/null is an ACID compliant database   jyu.dev/blog/why-dev-null... · Posted by u/swills
shakna · 4 months ago
It's down!

    $ telnet devnull-as-a-service.com 9
    Trying 2001:19f0:6c01:497:5400:ff:fe69:8cbf...
    Connection failed: Connection refused
    Trying 45.76.95.197...
    telnet: Unable to connect to remote host: Connection refused

yccs27 · 4 months ago
> 85,66% guaranteed uptime (we need some sleep, too)

u/yccs27

KarmaCake day1158November 21, 2020View Original