Re:The Beginner's Textbook for Homomorphic Encryption
by jlokier on Tuesday September 23, 2025 @11:51AM
(#45348750)
> In turn, every computable function on the real numbers is a continuous function
That doesn't seem right. Consider the function f(x: ℝ) = 1 if x >=:0, 0 otherwise. That's computable but not continuous.
The circuits are built out of "+" and "×" gates, which are enough to express any polynomial. In turn, these are enough to approximate any continuous function (Weierstrass's approximation theorem). In turn, every computable function on the real numbers is a continuous function - so FHE is very powerful.