4 ms·
Fully homomorphic encryption is also turing complete. Yet it's not possible to understand what such an algorithm is doing by design.
by 21 10y ago
Fully homomorphic encryption is also turing complete. Yet it's not possible to understand what such an algorithm is doing by design.
- drdeca 10y agoNot efficiently possible, But given enough time and memory, shouldn't it be possible? Although maybe that would require more than the universe has available, in which case I suppose it would be impossible in that sense I guess.