News for hackers. Stuff that matters.
Re:Unprovability comes to machine learning by lmm on Wednesday January 09, 2019 @07:09AM (#18864120)
> Suppose we are only working with rational multiples of Pi.

How would you start? You can't put a rational multiple of pi exactly into a computer. You can't get a rational multiple of pi exactly out of a computer. You can calculate rational numbers on the computer and scale them by a factor of pi outside the computer, if you really want, but that doesn't mean the computer is working with irrationals.

> It's not as though countability lends itself better to programming.

Huh? Yes it does; countable sets are still infinite but they're better-behaved than bigger sets.

Re:Unprovability comes to machine learning by mike00632 on Wednesday January 09, 2019 @03:21PM (#18868434)
>You can't put a rational multiple of pi exactly into a computer.

Of course we can: "1/2*pi"

>You can't get a rational multiple of pi exactly out of a computer.

Using the same limitations you seem to have in mind, we can't get one third exactly either.

>...countable sets are still infinite but they're better-behaved than bigger sets.

Yes, and that is surprising because we do have numerous clever applications that skirt around most of the intractability of exotic real numbers. That is why I think this paper is a bid deal, especially because it points to the cardinality of the real numbers instead of, say, their inclusion of the uncomputable numbers.

Re:Unprovability comes to machine learning by lmm on Wednesday January 09, 2019 @06:10PM (#18869962)
> Using the same limitations you seem to have in mind, we can't get one third exactly either.

We can work with exact rationals; we can do arithmetic on them and normalize them. In particular, we can compute whether two rationals are equal (in finite time), which we can't do with reals.