5 citations · 11 across the 7 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016★ 1 cited
Reactive Turing Machines with Infinite Alphabets
Bas Luttik, Fei Yang
The notion of Reactive Turing machine (RTM) was proposed as an orthogonal extension of Turing machines with interaction. RTMs are used to define the notion of executable transition…
cs.LO2016
On the Executability of Interactive Computation
Bas Luttik, Fei Yang
The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTM…