Abstract algorithms given in computer science could meet that condition, so long as they're defined on a turing machine. Eg., you could have a gravitationally

Abstract algorithms given in computer science could meet that condition, so long as they're defined on a turing machine. Eg., you could have a gravitationally stable solar system whose planets, etc. you identified with terms (etc.) and observe that the whole thing runs at zero-energy. This distinguishes abstract algorithms, which are just restatements of mathematics, from "programs" which are algorithms defined for electrical devices with relevant useful capacities.