12 citations · 88 across the 34 of their papers we have counts for
1 paper · 1 filter
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…