3 ms·
My understanding is more hand-wavy than formal, but would the combination of a total language and some limitation on the total number of instructions produce a
by asynchrony 8y ago
My understanding is more hand-wavy than formal, but would the combination of a total language and some limitation on the total number of instructions produce a provably predictable language?
- lmkg 8y agoLikely 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.