solinent

30 ms·

241.
by solinent 7y ago
Note that there's no way to observe a particle without some form of entanglement, though.
242.
by solinent 7y ago
> [...] quantum physics on a deep, intuitive level, probably do not. Intuition and understanding are two different things. Our intuition behind quantum mechanics is obviously wrong--quantum mechanics doesn't even obey regular logic!
243.
by solinent 7y ago
The biggest problem in mathematics has never been proving theorems. Mathematics was never focused on proof until the formalization of math became popular approximately 100 years ago. Mathematics is used as a tool to explain the world and t
244.
by solinent 7y ago
I think quantum mechanics is well-understood, the mathematics behind it provide us with excellent predictions. I think because at its core it is a probabilistic (or perhaps there are many worlds, but the implications are identical) theory--
245.
by solinent 7y ago
Yup, my definition of interpretation was limited for pedagogical purposes, but I should have been clearer. The propositional logic version is much simpler to understand, but the implications of the theorem are much more interesting in first
246.
by solinent 7y ago
Essentially, all logically valid formulae have proofs in first-order logics. Remember, logically valid formulae means that if you enumerate all possible interpretations (boolean values for the variables), the formulae remains true. So you c
247.
by solinent 7y ago
A class is fundamentally about implementing object semantics. This simply means everything (eg. all objects) are an instance of some class. It has methods which can be used to operate or communicate with other objects or itself. Data-struct
248.
by solinent 8y ago
g f x would not be the same as (g . f) x you need the right associative function application operator $, ie. g $ f x or simply g (f x)
249.
by solinent 8y ago
Only 2000IU per day. I'd like to see one with 10000IU.
250.
by solinent 13y ago
I can imagine this happening in template code: template <typename T> bool isNumberInfinity(T number) { return isinf(number); } template <> bool isNumberInfinity(Number number) { ret
251.
by solinent 14y ago
The "assembly language" for ML would actually be the lambda calculus. Scheme isn't really defined unless you're talking about some standard, and the semantics of the language are probably just defined in English.
252.
by solinent 16y ago
A Boeing can't reproduce, and cannot heal itself. (edit: I mean to say that there are processes that evolution has evolved that have eluded us and may continue to elude us indefinitely)