On Thu, Jan 29, 2015 at 10:21 AM, Shachar Shemesh <shac...@shemesh.biz> wrote:
> On 28/01/15 20:04, Oleg Goldshmidt wrote: > > Omer Zak <w...@zak.co.il> <w...@zak.co.il> writes: > > > After a brief Google search: > Does anyone know about any research, theory or practice of time-varying > finite state machines? > > Short answer: I don't. ;-) I'll offer a couple of thoughts, anyway. > > > I mean FSMs which might grow a new state, remove a state, add/subtract > transitions by means of meta-rules. > > I suppose it may be possible to write a FSM in such a way that > adding/removing the allowed states and transitions dynamically would be > possible. This would not be enough, though: any "interesting" FSM would > not just formally move from one state to another but do custom stuff as > a part of a transition, and one would want to create and load such > custom code dynamically. > > > Didn't you just describe a Turing machine? > Turing machine is finite and has certain number of states with defined transitions. I think what Omer meant here was more of a dynamic Turing machine. -- Ori Idan > > Shachar > > _______________________________________________ > Linux-il mailing list > Linux-il@cs.huji.ac.il > http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il > >
_______________________________________________ Linux-il mailing list Linux-il@cs.huji.ac.il http://mailman.cs.huji.ac.il/mailman/listinfo/linux-il
