5 citations · 11 across the 7 of their papers we have counts for
1 paper · 2 filters
Bas Luttik, Fei Yang
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it i…