• 0 Posts
  • 4 Comments
Joined 1 year ago
cake
Cake day: July 4th, 2023

help-circle

  • I never looked into this, so I have some questions.

    Isn’t the overhead of a new function every time going to slow it down? Like I know that LLVM has special instructions for Haskell-functions to reduce overhead, but there is still more overhead than with a branch, right? And if you don’t use Haskell, the overhead is pretty extensive, pushing all registers on the stack, calling new function, push buffer-overflow protection and eventual return and pop everything again. Plus all the other stuff (kinda language dependent).

    I don’t understand what advantage is here, except for stuff where recursive makes sense due to being more dynamic.


  • Yea, this is a funny thing to think about.

    You can jerk off to photos of people, you can imagine some wild things involving other people etc.

    If you just create some deepfake porn to masturbate by yourself to, I don’t see a big problem with that.

    The only issue I can find is, that due to neglect someone else sees it, or even hears about it.

    The problem starts with sharing. Like it would be sexual harassment to tell people who you are masturbating to, especially sharing with the “actors” of your fantasies.

    There is however another way this could go:

    Everyone can now share nudes with way less risk.

    If anyone leaks them, just go: “That’s a deepfake. This is obviously a targeted attack by the heathens of the internet, who are jealous of my pure and upstanding nature. For me only married missionary with lights out.”


  • Can we stop pretending Rust doesn’t take performance trade-offs? Of course if you compare it one to one its roughly the same, since it’s compiled. But Optimizing memory for cache hits becomes a lot more difficult in Rust, to the point where you have to use unsafe. And unsafe Rust has more undefined behavior than C. In my opinion C is more safe than unsafe Rust.

    If you want normal performance its a good Language, but once you need to Optimize memory, which is usually the bottleneck, You are out of luck.