Realisation of "Black Boxes" Using Machines
Grygoriy Zholtkevych · 2015
Modern engineering solutions attract attention of researchers to well-known problems in the field of system theory and cybernetics in general. The realisation problem of a “black box” is one among these problems. In this paper the non-anticipation property for a “black box” is generalised to the case of “black boxes”, whose behaviour admits deferred decisions. Furthermore, for such “black boxes” it is shown that they can be realised as pre-machines, which have been introduced by author jointly with his co-authors in series of earlier papers.