this post was submitted on 14 Jan 2025
410 points (90.5% liked)
Programmer Humor
32877 readers
1647 users here now
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
- Posts must be relevant to programming, programmers, or computer science.
- No NSFW content.
- Jokes must be in good taste. No hate speech, bigotry, etc.
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Approximation is an important tool for compressing information into useable forms. All labels are limited approximations too. Such compression is inevitably lossy, but that is a sacrifice for the sake of practicality. The important question is what level of compression is acceptable for a given context. If I describe the location of a chess piece on the board, I don't need to specify how far off-center on its square a given piece is, so a 0-7 offset along each of the two axes is enough for game purposes.
When it comes to gender, I think we all agree that [0, 1] is insufficient, but how do we determine what is sufficient? Do we argue that a 2-bit vector (masc, fem) is enough to describe {neither, fem, masc, both} for rough rounding, or do we need more detailed values along those axes, or perhaps a third axis too (or more)?
This is a very nice and effective blurb, I'm saving this comment for future use
There's no awards/medals here but take this: ๐ฅ
Maybe a byte using bitflags?