4 ms·
> Hou and Luo’s work was suggestive, but not a true proof. That’s because it’s impossible for a computer to calculate infinite values. It can get very close to
by thaumasiotes 4y ago
> Hou and Luo’s work was suggestive, but not a true proof. That’s because it’s impossible for a computer to calculate infinite values. It can get very close to seeing a singularity, but it can’t actually reach it — meaning that the solution might be very accurate, but it’s still an approximation.
I feel certain that if you run a process that approaches infinity using ordinary floating-point numbers, you will actually reach infinity. This is a case ("can a calculation yield an infinite result?") where computers have less of a problem than people do.
You'd have to deal with the question of whether the infinite value accurately reflected an infinite limit of the process or whether it was spurious. But there's no difficulty in calculating infinite values.
- blurbleblurble 4y agoDouble precision floats have a maximum value of 1.7976931348623158 E + 308
- onion2k 4y agoAka not infinity
- PartiallyTyped 4y agoThey meant maximum finite value. 0 11111111111 0000000000000000000000000000000000000000000000000000 (base 2) ≙ 7FF0 0000 0000 0000 (base 16) ≙ +∞ (positive infinity) 1 11111111111 0000000000000000000000000000000000000000000000000000 (base 2) ≙ FFF0 0000 0000 0000 (base 16) ≙ −∞ (negative infinity)
- thaumasiotes 4y agoThat is not correct; they have a maximum value of positive infinity. See what you get when you square 1.7e+307.
- mjburgess 4y agoA computer is always just a function from {0,1}^N -> {0,1}^M The "Inf" interpretation, of, eg., 11111111111111111 isnt infinity. And, in general, almost every function isnt representable on the discrete domain above. floats are a hacky interpretation of discrete bit patterns
- thaumasiotes 4y ago> A computer is always just a function from {0,1}^N -> {0,1}^M > The "Inf" interpretation, of, eg., 11111111111111111 isnt infinity. This is incoherent nonsense. If you want to say that the floating point value "infinity" isn't really infinity, you must also say that nothing else is really infinity either. That is true in a completely useless and uninformative sense, but it's false in every sense a person would ever use. And it fails to distinguish the correct mathematical proof demonstrating an infinite limit from the simulation suggesting, but not demonstrating, an infinite limit. Neither of them is really infinity. Each of them can represent infinity just as accurately as the other, though. A paper is just a function from a bounded countable subset of ℝ² to another bounded countable subset of ℝ². What would you conclude, from that, about the limitations of what you can represent on paper?
- mjburgess 4y agoI'm not sure where your misunderstanding comes from, but at least, you might consider you're disagreeing with an article on quanta magazine which writes up a project by experts in their field. In any case, no. The idea that a finite number of bits in a particular state "must just be infinity!!!! because the IEEE ref docs say so" is strange to say the least. The issue is to demonstrate that a given function, say f, for given real-valued inputs, say x, has an output y which is not real-valued and goes to infinity. A computer cannot demonstrate such a thing, because real-valued functions aren't computable. No sequence of bit patterns on a computer can ever show the above, because the above is an issue of the limits of a continuous function. Relevant inputs to the function have an infinite precision, and relevant outputs have an infinte precision. Eg., x = pi, y = pi^100 A computer may very easily mistakenly conclude x = pi is an input which becomes infinite in y, because (1) a computer cannot represent pi; and (2) cannot represent pi^100 either. infinity isn't a bit pattern; and isn't here in any relevant sense even a number; the IEEE standard may as well have said "Overflow"
- vardump 4y agoYou can combine two doubles to double precision, to 107 bits. https://en.wikipedia.org/wiki/Quadruple-precision_floating-point_format#Double-double_arithmetic https://en.wikipedia.org/wiki/Quadruple-precision_floating-p...
- somat 4y agoIt does not have to use floating point numbers, while floating point numbers are hardware accelerated and thus very fast, there are infinite precision number libraries. But more likely, the program would have to be built where it understands the symbolic forms involved, more like a proof solver than simple cfd math.
- StillLrning123 4y agoSo are they trying to find particles in the fluid with a flow of 0?
- Karliss 4y agoSure calculating infinity is easy as long as you redefine "infinity" to be something which isn't actual infinity. But it's useless for many mathematical proofs. Having overflow of some finite floating point calculations labelled as "infinity" is useful for calculations of some practical problems, but it shouldn't be confused with the actual mathematical concept of infinity just because both use the same word.
- thaumasiotes 4y agoFloating point infinity is "actual infinity". It has all the correct mathematical properties. If you want to slam a special IEEE constant, you should slam 0, which has different properties from mathematical zero.
- majewsky 4y agoAccording to my Javascript console (using IEEE754 double precision), 1e308+1e308 equals Infinity. That's not "actual infinity".
- blurbleblurble 4y agoIt's always going to be an approximation, and if you do some serious work with computer graphics you'll say some point maybe get a chance to see that the limits of floating point numbers aren't actually as large as they seem. Double precision is way bigger than single precision but still, if computers could actually "reach infinity" there wouldn't be any issues with floating point error in sensitive calculations. But the fact of the matter is that there is. And at any rate, "infinity" is not a single value to be reached. Take an analysis class and you'll understand this better!