A trivial machine has a simple mechanism:
A certain operation (f) is done with an operand (x). The result is (y).
Because (f) is determined, the result is determined and predictable (von Foerster & Poerksen, 1999, p. 57).
If we insert a coin in a chewing gum machine, we get a chewing gum, not one time a peppermint, next time a condom.
Trivial machines are
- synthetically deterministic,
- history independent, i.e. every following operation is according to the operation before,
- analytically determinable, i. e.knowing some x and y, we can reconstruct the operator f,