computational irreducibility

Question

computational irreducibility

In: 9

Answer 1

A process or algorithm is “computationally irreducible” if there’s no other, more efficient process you can create to predict what the algorithm will return. For a computationally irreducible algorithm, the most efficient way to see what the it does is to simply run it.