![](/static/253f0d9b/assets/icons/icon-96x96.png)
![](https://mander.xyz/pictrs/image/dbeda0de-d3fb-4fab-8703-3e52e72cb4db.jpeg)
Columbus was wrong. He thought the diameter of the earth was much smaller that the common estimate at the time which turned out close to the actual value.
Columbus was wrong. He thought the diameter of the earth was much smaller that the common estimate at the time which turned out close to the actual value.
What is the methodology called where you:
Plan to go to orbit, blow up seconds into the flight, and declare it a success.
Plan to refuel in orbit, make it minutes before the rocket brakes. Fire the FTS, it fails, the rocket blows up a minute later und declare it a successful test of the FTS.
Argue to NASA that you are not the limiting factor to the moon mission planed for the end of the year, despite delivering none of the milestones.
FTS = flight termination system
I think Dylan Beattie once said: If you don’t have a plan, how can you choose not to follow it?
Websites have grown beyond mere scripting.
Rust is about more than just nicer pointers, it has a very expressive type system that enables correctness rarely seen outside FP.
Instead of
if let Some(a_) = a{
()
} else if let Some(b_)=b{
()
} else {
dostuff
}
you could just use
if a.isNone()&&b.isNone(){
dostuff
}
Also if you don’t use the value in a match just use _
Ah the old Univertium ofium Berkelium Californium joke
Aviation, Health, Space and Car industry have only 3 certified languages that they use. Ada, C and C++.
Rust is automotive certified since over half a year. https://ferrous-systems.com/blog/officially-qualified-ferrocene
I don’t know if prime factorization is the correct English word for it but the operation I am referring to takes a (non zero) natural number and returns a multiset of primes that give you the original number when multiplied together.
Example: pf(12)={2,2,3}
if we allowed 1 to be a prime then prime factorization cease to be a function as pf(12)={1,2,2,3}
and pf(12)={1,1,1,1,2,2,3}
become valid solutions.
1 being prime breaks a lot of the useful properties of primes, such as the uniqueness of prime factorization.
optimal design for actual humans to live and work
And H designs are just somehow aesthetically unpleasing to me personally (for real).
Because I agree with those points I resigned it by flipping the edges:
.║ ║ ║
.║ ║ ║
.╚═╬═╝
. ║
.══╩══
If we orient it south and try to distribute sunlight fairly we may get something like this:
. ║
.║ ║ ║
.╚═╬═╝
. ║
.╚═╩═╝
Don’t explain the ieee floating point standard to mathematicians from within punching distance.
0 == -0
but also 0 > -0
1/0 == 2/0
but 1/0 != 1/(-0)
not(x<y) and not(x>y) and not(x==y)
where x
is NaN
x!=x
where x
is NaN
I would say that whole numbers and integers are different names for the same thing.
In german the integers are literally called ganze Zahlen meaning whole numbers.
I think it would have a real time kernel running parallel to a linux kernel.
Users could interact with the linux kernel normally and schedule trusted real time tasks on the other. Maybe there is reduced security for added performance on those cores.
In general use it would be a normal stable system with the allure of a performance mode that will break your system if you are not careful.
I want to be Q from Star Trek.
SYN-ACK
Sleep sort is kind of like count sort but with added overhead. Both have a complexity of O(n+m) with n being the length and m the value of the max element.
The optimum of O(n * log n) is based on the assumption that the only information about the values is obtained by comparison. If you operate on integer keys I would recommend radix sort. It has a complexity of O(n * w) where w is the length (read logarithm) of the key.
I can’t find the name/source at the moment, but if you enumerate all turing machines and run them concurrently* you will find the optimal algorithm for your problem in O(1) and executed that.
To my knowledge the algorithm is so inefficient on small input that it takes hours to solve integer addition.
* You run the first turing machine one step, than the first two one additional step, that the first tree… This allows you to run an unlimited amount of TMs an unlimited amount of steps.
Nitrogen also becomes toxic, requiring you to substitute it with helium (or hydrogen).
Interesting talk on the subject: https://youtu.be/skL5EQa8DFY
Red is acidic, she is dr
oiping the base to reduce the acidity.Maybe the usual way is to drip acid into the base (I don’t remember either), in which case a red indicator means she past the point of equalization.