You can always increase the precision of a computation, analog signals are limited by quantum physics.
anton
joined 1 year ago
Show me the regex for the language L = {a^n b^n | n in N}
~~Neat idea but it needs the ape loader to be installed.~~
Even if it made mining more efficient, Bitcoin would just increase difficulty to compensate.
Bitcoin is a system adverse to efficacy.
In my IDE there us even a button for accepting the compilers recommend fix. This is only possible because the error messages and recommendations are that good.
What's the problem with -0?
It conceptually makes sense for to negativ values to close to 0 to be represented as -0.
In practice I have never seen a problem with -0.
On NaN: While its use cases can nowadays be replaced with language constructs like result types, it was created before exceptions or sum types. The way it propagates kind of mirrors Haskells monadic Maybe.
We should be demanding more and better wrapper types from our language/standard library designers.
Just build submarines, smh my head.
You can't random-access an iterator and use it again later.
If your specific use case really needs random access to a list while lazy computing the elements just wrap them in Lazy and put them in a vector.
Can Rust compute the value of calling a function an infinite number of times?
The return type of an infinitely recursive function / infinite loops is ⊥, a type that by definition has no values. (Known in rust as !)
Imagine using a linked list as your default sequential container.
Rust iterators are lazy btw.
Take your xenophobia back to reddit.
Thanks, I missed it.