I was just wondering if there are estimations possible for an algorithm using a fixed number of random binary or arithmetic operation on an input of how many (input, output) pairs are necessary to be probably able to reverse engineer this algorithm.And in addition if having any (input, output) combination, the computation time to reverse engineer with fixed computation power (on a regular von neumann architecture).The only thing I found so far is something about logical depth and how to compare the complexity of algorithms.
Time reverse engineering a random algorithm
cryptanalysis