Only if the the algorithm is somewhat trivial. Counterexample: Solving the traveling salesman problem to optimality. We know exactly the requirements, yet we

Only if the the algorithm is somewhat trivial. Counterexample: Solving the traveling salesman problem to optimality. We know exactly the requirements, yet we have been struggling for decades to find an algorithm that satisfies the requirements. We have not, and we probably never will.