Overview
Syllabus
0:00 Apple vs Google
0:38 Floating Point Arithmetic
4:11 Rationals and Dyadic Rational Approximations
7:23 Recursive Reals
9:48 Addition of Recursive Reals
15:05 Decidability
18:00 Implementation
24:53 Check out Brilliant.org/TreforBazett
8:42 I say we can UNIQUELY choose a dyadic rational within that error bound that has the denominator 2^n. It isn't quite unique. Take 1/3 rounding to the nearest 1/4. Both 1/4 and 2/4 are within the error range. But that's ok, you can choose either of them and ultimately all we care about is choosing something within the error bound that is as small from a memory perspective, i.e. smaller denominator as possible. I can't tell from paper, but I suspect in the implementation it spends a bit of computational time to adjudicate that 1/4 is closer than 2/4 and so chooses that one
Taught by
Dr. Trefor Bazett