Real-time computations are a class of problems solved within the framework of the theory of algorithms and first considered by Hisao Yamada in 1962. Typically, problems are formulated in terms of abstract calculators, such as a Turing machine or a Post machine , and are associated with studies of the properties of monotonically increasing functions for which there is a generator of sequences of output characters printing on tape measure , if a for some , and otherwise. Such functions are called “real-time computable” [1] .
Solutions to such problems can be used as a theoretical basis for proving the correctness and effectiveness of algorithms used in real-time systems .