Likely not. It takes only a very small number of instructions to implement an interpreter for a Turning-complete language, and then you can create arbitrary beh

Likely not. It takes only a very small number of instructions to implement an interpreter for a Turning-complete language, and then you can create arbitrary behavior by passing different input. The number of necessary instructions is shockingly small, if using something like Binary Lambda Calculus or Subtract-And-Branch-If-Negative.