The Banach-Tarski paradox says that a ball in $\mathbb{R}^3$ can be partitioned into a finite number of pieces, whose rearrangement has a larger volume than the original. It occurred to me that it might be possible to define the pieces $P_1,P_2,\ldots,P_n$ by a finite amount of geometric data, such that the applied rearrangement function $f(P_i)$ actually does increase the volume of $P_i$, because of floating-point round-off error: $f$ is an isometry but when implemented in floating-point hardware it is not an exact isometry. So it might be possible that $$\textrm{Vol}(f(P_1))+\ldots \textrm{Vol}(f(P_n)) > \textrm{Vol}(P_1)+\ldots \textrm{Vol}(P_n) \;.$$ Repeating, this might lead to a type of "realization" of the paradox in terms of floating-point computations.
Whether you think this would be as interesting as I do is in the eye of the beholder.