• 0 Posts
  • 14 Comments
Joined 1 month ago
cake
Cake day: December 10th, 2024

help-circle
  • Is gender dysphoria not considered a health issue […] Feel like having pre-transition gender dysphoria compared to other mental illnesses like anxiety/depression/etc is a positive thing because it normalizes it to a degree.

    There’s an inherent problem of definitions here:

    Consider: does the DSM classify transgender as a mental disorder? Hard to say. It includes 302.85: Gender Dysphoria, defined as “a marked incongruence between one’s experienced/expressed gender and assigned gender”. It also includes approximately one million caveats saying that transgender definitely isn’t a mental disorder. Why the contradiction? Because regardless of the philosophical definition of mental disorder, the practical definition is:

    • If you call something a mental disorder, insurance has to cover treatment for it, which is good.
    • But if you call something a mental disorder, people will accuse you of trying to stigmatize them, which is bad.

    The DSM writers are trans-friendly and want to make sure trans people can get the care they need (for example, in most states, people need a psych evaluation before they can get gender affirmation surgery), so they want to force insurance companies to cover transgender, so they have to include it. But they also don’t want to stigmatize trans people, so they also include a lot of paragraphs about how even though they just listed it as a mental disorder, it definitely isn’t a mental disorder.









  • I’m not sure what the author meant by this. Python does support parallelism via multiprocessing (and in experimental versions, via threads in no-GIL builds), e.g. like this. It’s a bit questionable whether it’d help here, because the overhead of sending the inputs between workers may be comparable to the speedup, but it’s certainly possible, and very common in real tasks.

    (I’m not familiar with Ruby, but from some googling it seems the situation is about the same as Python, but there’s not a stdlib implementation and instead you need to use something third-party like the parallel gem.)


  • I can’t tell if this is a joke or real code

    Yes.

    Will that repo seriously run until it finds where that is in pi?

    Sure. It’ll take a very long while though. We can estimate roughly how long - encoded as ASCII and translated to hex your sentence looks like 54686520636174206973206261636b. That’s 30 hexadecimal digits. So very roughly, one of each 16^30 30-digit sequences will match this one. So on average, you’d need to look about 16^30 * 30 ≈ 4e37 digits into π to find a sequence matching this one. For comparison, something on the order of 1e15 digits of pi were ever calculated.

    so you can look it up quickly?

    Not very quickly, it’s still n log n time. More importantly, information theory is ruthless: there exist no compression algorithms that have on average a >1 compression coefficient for arbitrary data. So if you tried to use π as compression, the offsets you get would on average be larger than the data you are compressing. For example, your data here can be written written as 30 hexadecimal digits, but the offset into pi would be on the order of 4e37, which takes ~90 hexadecimal digits to write down.