6 ms·
It sounds like we can too determine its practical effect, which is zero. No real-world machine learning algorithm can use the real numbers. We can not obtain th
by jerf 8y ago
It sounds like we can too determine its practical effect, which is zero. No real-world machine learning algorithm can use the real numbers. We can not obtain them to feed them as input, our real-world machines can not process them if we could, and if we got real-number-based answers, we could not use them. Whether the universe itself is or is not based on real numbers, we do not have access to them either way. Our real-world machines only have access to the computable numbers (and only a subset of them, at that).
I'm only speaking to the practical impact.
It's possible someone will find some way work this down into something practical, but I'd be fairly surprised. Real machine learners get finite data, for which the continuum hypothesis is irrelevant.
(I assume the original authors fully understand this.)
- gowld 8y agoThe press release says "So these results might not turn out to have practical importance." As you state, that's a much weaker statement than the truth: "So these results almost certainly have no practical importance", and as expected, the stronger statement is nowhere in the original paper. The press release, while being careful not to make false statement, commits a pragmatics sin of letting the reader think there is something going on (by saying "maybe" where they should say "almost certainly not", and by even publushing in the first place a pop-science summary of a highly technical result that has no meaning to a popular audience, and so necessarily the (abstract mathematical, unphysical) importance of the reuslt is completely destroyed in translation.
- mike00632 8y ago>We can not obtain them to feed them as input, our real-world machines can not process them if we could... I'm not sure about this. We often make calculations with computer representations of real numbers. We can calculate quantities based on algebraic or transcendental numbers with arbitrary precision (optimizations, navigation), or we can use them as a basis (image processing) and represent rational numbers in their terms. Real numbers are all over computer applications.
- wyattpeak 8y agoArbitrary precision is irrelevant. By it we mean arbitrary finite precision, which leaves us not only with computable numbers, but rationals. Representing rationals isn't affected by the paper's findings, because they have the same cardinality as the naturals. Arbitrary precision models reals, it doesn't actually use them.
- mike00632 8y ago>We can not obtain them to feed them as input, our real-world machines can not process them if we could Suppose we are only working with rational multiples of Pi. Then we can ONLY have finite calculations of irrational numbers and it's impossible to have a finite calculation of a rational number (except for multiplication by 0). >Representing rationals isn't affected by the paper's findings, because they have the same cardinality as the naturals. The Natural numbers are still infinite which presents its own inherent difficulty. It's not as though countability lends itself better to programming.
- roywiggins 8y agoAll of the rationals are computable. Almost all of the irrationals aren't computable at all... so there's a big difference there.
- mike00632 8y agoYeah, and I suspect that has a lot to do with the underlying mathematical principles too. But the paper instead reduces the issue to the Continuum Hypothesis. The problem might not even have anything to do with countability but instead be fundamentally about the differences between infinite cardinals.
- throwawaymath 8y agoFirst and foremost: > The Natural numbers are still infinite which presents its own inherent difficulty. It's not as though countability lends itself better to programming Actually countability does lend itself to programming, essentially by definition. You cannot write a function to enumerate all the real numbers precisely because they're uncountable, even if you had an infinite amount of time. You can trivially do this with a "merely" countably infinite set, like the naturals or rationals. > Suppose we are only working with rational multiples of Pi. Then we can ONLY have finite calculations of irrational numbers and it's impossible to have a finite calculation of a rational number (except for multiplication by 0). It sounds like you're suggesting we can store an irrational number in a finite representation by generating it with a finite function (e.g. multiply a rational number of times). But that doesn't work. You can't represent a number N in a finite number of steps if you can't represent all factors of N in a finite number of steps. This fact follows from the field axioms for the same reason that all products of irrationals and rationals are themselves irrational. Simply put, if you can't do it for Pi, you can't do it for a rational multiple of Pi.
- no_identd 8y ago>No real-world machine learning algorithm can use the real numbers. That depends entirely on what one means by "real numbers". See previous hacker news discussion of a different paper on real numbers, here: https://news.ycombinator.com/item?id=17291752 https://news.ycombinator.com/item?id=17291752
- jackpirate 8y agoThat's like saying that the undecidability of the halting problem has no practical effect because real world computers are actually finite state machines and not turing machines. This argument is true in only the most superficial way. I haven't read the paper and so don't know how applicable it is, I just don't like your argument.
- deleted 8y ago[deleted]
- ubershmekel 8y agoThe undecidability of the halting problem has no practical effect.
- Znafon 8y agoIsn't it one of the reason limiting the power of static analysis and force us to use dynamic analysis to get certain information about the correctness of our programs ?
- red75prime 8y agoIf the halting problem was merely NP complex, it would have still limited practical possibilities of static analysis.
- adrianN 8y agoEh, modern SMT solvers are very practical tools, as are solvers for Mixed Integer Linear Programs. NP-completeness doesn't mean that you can't solve most instances you care about in reasonable time.
- red75prime 8y agoYes. And the halting problem doesn't preclude static program analysis even if it works with only a subset of all possible programs.
- Retra 8y agoYou can certainly use real numbers. You just have to pick the finite subset of them that you need for a given problem and an appropriate encoding for them.
- throwawaymath 8y agoThat's not what they mean by "use real numbers." If you're using a finite subset of the reals, you're not using the reals. We can only approximate real numbers in a finite representation.
- Retra 8y agoThat's all anybody has ever done. You may as well be claiming that the reals don't exist because no mathematician has conceptualized one non-symbolically and non-approximately. When you do calculus on the reals, you only ever approximate or encode a finite (really, countable) subset of them.
- BlackFly 8y agoIt seems to me that if your argument is valid then the situation is even worse for machine learning. That is to say, if machine learning cannot use the real numbers then they cannot solve any problem which depend on any properties of the reals, such as producing a machine learned function to compute the square root of two. Now, it may be true (in fact I think it likely to be true) that the cardinality of the reals is a little bit different of a property than the denseness, enough so that machine learning can approximate the denseness and not the cardinality, but the reason for this doesn't seem to be simply "machine learning doesn't use the real numbers".
- adrianN 8y agoThat is not surprising at all. The set of real numbers that can be produced by a computer is countable. That means that almost all real numbers are uncomputable. (Square roots of natural numbers are computable though.)
- jerf 8y agoTo the many people who attempted to correct me about what portion of the reals we can use, the computable numbers are exactly that portion (or, as I said, the subset the of it we are large enough to represent). Look up "computable number". Pi, and all rational multiples of pi, are in that set, for instance. It has many interesting properties. Among those properties is that it contains every number you could every conclusively identify, and that it is only countably infinite, meaning it is much smaller than the reals. It is useful for many things (and a good thing it is, since it is the most sophisticated set of numbers we actually get to compute with), but it is no substitute for the reals.
- titzer 8y agoThere are no real numbers in nature, as the Heisenberg uncertainty principle means that all measurements have an error bound--i.e. are intervals. Our mathematical tools for quantum mechanics are wave functions, with presumed real-valued quantities. Problem is, we can never feed them precise enough inputs for that to matter, since all of our measurements are interval-valued quantities.