This gives a level of persistence edging the functionality closer to stateful business logic.
stateful (sequential) business logic
any arbitrary logic that does retain state internally. That is, it has memory.
Or, it’s a combinational logic circuit with at least one feedback loop (and a clock).
For example, a microprocessor has an internal register that gets updated according to machine-code instructions that are sent to it.
More generally, stateful business logic is a Turing machine that takes in a sequence of inputs, and returns a sequence of outputs. Systems that manifest (a practical approximation of) this are called Turing-complete systems.
I say “Turing complete” here in a practical sense, not in a theoretically pure sense.
That is: the machine returns a string of outgoing bits as a function of the incoming bits and its current internal state;
but practical in the sense of not running infinitely long
or claiming to solve the “when does the machine stop” problem (halting problem).