reichstein

7 ms·

31.
by reichstein 2y ago
So you're saying that "an ask" is "an order" or "a demand", rather than "a request". Why not use those words? I don't understand what "an ask" means. I don't know what the sp
32.
by reichstein 2y ago
I'm personally convinced that the reason the conditional operator of called "the ternary operator" it's that the ANSI C Programming Language book contains the phrase "the ternary operator, ?:", and a lot of rea
33.
by reichstein 2y ago
Agree, other than that I wouldn't use "2-arity". Maybe "2-ary", but that's just "binary" written confusingly. It works for "n-ary". I'd rather say that a binary operator _has_ an arity
34.
by reichstein 2y ago
"Success" is to achieve the intended goal, without causing new problems that outweigh the benefit of reaching that goal. Reaching the goal is not a moral measurement, it is all about efficiency. If you don't reach the goal, y
35.
by reichstein 2y ago
Many quick-sort implementations are deterministic, so will consistently have their worst case behavior on the same inputs again and again. The good ones try to do a little better than choosing the center element as pivot, but with a well cr
36.
by reichstein 2y ago
That's not how it works. Maybe if I'm given two colors inside that range, I can say which is bluer and which is greener. Given just one color, I simply cannot say that it's green or blue, or even if it's more green than
37.
by reichstein 2y ago
The word "development" can mean several things. I don't think "software development" sounds bad when grouped with a phrase like "urban development". It describes growing and tuning software for, well, work
38.
by reichstein 2y ago
And I got it. When the algorithm sees a word that is already in the list, it discards the word in the list first. Then it adds the word again with the same probability as any other word. This ensures that only the last occurrence of each w
39.
by reichstein 2y ago
The way I'd describe it is: - You have a buffer. You initially try to fit every unique word on there. - If the buffer gets full, you know that you can't fit all the unique words in there. So you decide to keep only a fraction, _p
40.
by reichstein 2y ago
NAND gates are enough to computer any boolean function. Being Turing complete requires some notion of state and state transition. However, a RAM machine where the program counter is memory mapped, can be Turing complete with a [single machi
41.
by reichstein 2y ago
Pretty much. _Language_ is how we propagate meaning. Words are units of language, that can be used to build larger composite language constructs. (And words, _when written_, are themselves built from smaller syntactic units, letters, at le
42.
by reichstein 2y ago
When you read the post, it does sound slightly deranged, but if you check the links, they're not actually as bad as they sound. If everybody agrees, you won't get the kind of conflict about company choices that this is about, so o
43.
by reichstein 3y ago
GC is usually not specified to happen at particular times, or saying which values are definitely going to be GCed. Instead it relies on the language semantics, so that any value which is used later in the program, is not going to be GCed. H
44.
by reichstein 3y ago
Not guessing at what the original author intended, but the formula `floor(x + 0.5)` does not currently round to the nearest integer for all floating point values. If 0.5 is just outside the bits of the mantissa, there will be an intermediat
45.
by reichstein 3y ago
I got a 100% agreement with majority too. I did not try to define anything formally, instead I judged each case by itself, asking whether I'd consider that thing a "vehicle". Which ended up meaning "car" in practice
46.
by reichstein 3y ago
Which is probably not a coincidence, since the article was written by the same Robert Nystrom.
47.
by reichstein 3y ago
> ... move [to the US] and renounce the trade for good ... Publicly. Then possibly work for the NSA/CIA instead. > ... bounties ... on people who are not US citizens. Because that's not going to cause an uproar if done unil
48.
by reichstein 3y ago
There is every reason for a technical specification to be unambiguous. That's it's one job. Behavior must be clearly within spec or not, otherwise it hurts interoperability. Implementations should support the entire spec, and not
49.
by reichstein 3y ago
If they give you free internet in your room, you won't pay for their pay-TV. Especially the kind you won't be watching in public areas. "Follow the money"
50.
by reichstein 3y ago
Some businesses like to retain users, and not alienate them using obscure, hard-to use-user interfaces, and blaming the user when they get it wrong. If you can't create a way to say "yes", which is at least as easy to use as
51.
by reichstein 3y ago
They totally do, but there is no single file type which supports all the formatting you might occasionally want, like math or floating text boxes or images, at least no format short of PDF. And which is editable, quotable (important for e
52.
by reichstein 3y ago
It is as silly as bogosort. It's queue-sort. You put the elements into a priority queue, then remove them in property order and put them into a list. Here you just use the inherent queue of a timer system, which wastes time between ext
53.
by reichstein 3y ago
This design avoids the inefficiencies and most of the problems of having an?_iterator_, like the classical Java `hasNext`/`moveNext` or C# `MoveNext`/`Current` interfaces. Those iterators require you to keep the state between elem
54.
by reichstein 3y ago
I think KronisLV's point, presented ironically, is that not even an AI superior to human reasoning, which can figure out things we cannot, can decide the undecidable. Being undecidable is a hard limit, not something that requires bett
55.
by reichstein 3y ago
By all means work on getting `_Generic` removed again if that is what you want. As long as the feature is there, it should endeavor to be the best possible version of itself. Making it deliberately useless and unsuitable in order to avoid t
56.
by reichstein 3y ago
Just admit that it's pattern matching, and introduce a new variable for each match: ``` _Generic(expr0, type1 id1?: expr1, ... typeN idN?: exprN, default id0?: exprDefault ) ``` Every identifier is optional,
57.
by reichstein 3y ago
Only one of the holes has a trigger. You fill that last, or only.
58.
by reichstein 3y ago
I'll have to disagree. We can all agree that the "silently accept null" approach is, by now, a quadrillion dollar mistake. But having a safe "or null" union type as the _only_ union type in your language, isn't
59.
by reichstein 3y ago
I'm guessing "Little lost robot", from the "I, Robot" anthology.
60.
by reichstein 3y ago
If you ignore human psychology, ... well, you're probably not making a great app. Why have vanity badges, or other kinds of gamification, to begin with? Because it gives users an added incentive, through an added reward, a goal, which

More ›