Assuming an algorithm $A$ known to both Alice and Bob.
Alice runs the algorithm and gets a result $R$. How can Alice prove to Bob that $R$ is the result of the execution of $A$ and not some random value (without having Bob run the algorithm himself)?
Please note that Alice does not have to prove correctness of $R$, just that she ran $A$ to obtain $R$.
The algorithm and its inputs can be modified to build the proof if necessary
