Hi!

My previous/alt account is yetAnotherUser@feddit.de which will be abandoned soon.

  • 2 Posts
  • 392 Comments
Joined 2 years ago
cake
Cake day: June 1st, 2024

help-circle











  • Even though this isn’t C, but if we take from the C11 draft §6.8.5 point 6 (https://www.open-std.org/jtc1/sc22/wg14/www/docs/n1570.pdf):

    An iteration statement whose controlling expression is not a constant expression, that performs no input/output operations, does not access volatile objects, and performs no synchronization or atomic operations in its body, controlling expression, or (in the case of a for statement) its expression-3, may be assumed by the implementation to terminate

    “new Random().nextInt()” might perform I/O though so it could still be defined behavior. Or the compiler does not assume this assumption.

    But an aggressive compiler could realize the loop would not terminate if x does not become 10 so x must be 10 because the loop can be assumed to terminate.






  • Is it actually possible for a fish-like animal to have eyes at the front (i.e. an animal with a hydrodynamic shape that spends all its time underwater)?

    I feel like that’s really difficult for evolution to achieve, especially because the mouth has to go somewhere at the front too. I mean, look at where the lights of a high-speed train are placed and their shape.

    Intuitively it feels easier to just put the eyes on the side. Plus it feels like there’s a lower risk of damaging them when bumping into something.




  • Let M be the set of all memes.

    Is this well-defined? How can you tell whether something is an element of M?

    f(x) is a meme making fun of x for all x in M

    Does such an f even exist? Why? Obviously it exists for some x in M but for all?

    Thus there exists a normie meme n

    What’s a normie meme? Why does its existance follow?

    and a unique function F for all natural number k

    This again requires f to be well-defined.

    The set M is also equipped with a dankness norm.

    Prove it has that norm and please also prove it fulfills all properties of a norm.

    with property that ||F(k)|| ≤ ||F(k+1)|| for all k in N.

    [proof required]. Idea for a counterexample: A meme making fun of a meme in such a terrible way it cannot possibly be “danker”. Though this would require f^-1(terrible meme making fun of meme) to not be empty.