Comment on The Beginner's Textbook for Fully Homomorphic EncryptionparentComments−jlokier11mo> In turn, every computable function on the real numbers is a continuous functionThat doesn't seem right. Consider the function f(x: ℝ) = 1 if x ≥ 0, 0 otherwise. That's computable but not continuous.−ogogmad11moThat's uncomputable because equality of real numbers is undecidable. Think infinite strings of digits.
Comments
> 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.
That's uncomputable because equality of real numbers is undecidable. Think infinite strings of digits.