4 ms·
If you constrain your computer to always take the same amount of time to execute any while loop (which a homomorphic computer needs to do not to leak any data),
by heavenlyblue 6y ago
If you constrain your computer to always take the same amount of time to execute any while loop (which a homomorphic computer needs to do not to leak any data), your computer would also have unbounded circuitry complexity and thus it’s not any better.
Also unbounded loops can’t practically finish even on a Turing machine :)
- giomasce 6y agoThat's my point: not any Turing machine can be implemented with FHE, because FHE must have bounded execution time.
- heavenlyblue 6y agoYou can either say “a Turing machine can not be implemented” or “it can” but never “not any Turing machine” because there isn’t any types of a Turing machine - just a single one.