noncovalence
Joined 5 years ago
Joined 5 years ago
(Though what you're saying is not impossible per se, I think I read an experimental proposal a while ago which suggested achieving just that, iirc by using parity violation to generate chiral photons which then initiate some kind of reaction!)
There's also the infamous opening paragraph to the "States of Matter" textbook by David L. Goodstein:
Ludwig Boltzmann, who spent much of his life studying statistical mechanics, died in 1906, by his own hand. Paul Ehrenfest, carrying on the work, died similarly in 1933. Now it is our turn to study statistical mechanics.
The nefarious "2.2 GB RAM usage within 10 seconds" tab open in the background:
As someone who's often annoyed by games that make you choose between dialogue options that all lead to the exact same result, this criticism alone was enough to convince me to buy the game.
- How difficult would it be to add many-valued functions to this? It would be really nice to be able to get the full set of [pi/2, pi/2] + n[2pi, 2pi] from asin(1) without needing to break out Mathematica.
- And:
> Numbers input by the user are interpreted as the smallest interval that contains the IEEE 754 value closest to the input decimal representation but where neither bounds are equal to it
Am I missing something obvious, or should this be the other way round, i.e. the output bounds are the closest two IEEE 754 numbers that contain the input number?
The way it's written I'd interpret the smallest interval to be IEEE754(input)+[-epsilon, epsilon] for infinitesimally small epsilon.