Permanent Persistent Turing Machine: A new Model for Interactive Computation

Authors : Sepehr Ebrahimi MOOD, Mohammad Masoud JAVİDİ

Pages : 0-0

View : 16 | Download : 13

Publication Date : 2018-05-30

Article Type : Research Paper

Abstract :Since the computation of human life is in the progress rapidly and there is interaction in their computational process, we need to offer new concepts in computational theory, especially in the interactive computation to obviate these needs. In this paper, we introduce a new model for interactive computation. First, we briefly review interactive computation concept. Then, we provide and explain Persistent Turing Machine, as a model for interactive computation. There are some disadvantages in definitions of this model. For example, there is not functional property in the computational process of these models. As well as, the language which was accepted by this model, defined as a set of streams. Whereas, in other computational models, we use a set of strings, for indicating the language which was accepted by a model. As a result, we cannot compare the languages were accepted by these models, with the other models and their languages. Next, we propose Permanent Persistent Turing Machine insert ignore into journalissuearticles values(PPTM);, as a model of interactive computation, so that, eliminate these disadvantages. After that, we define sets and relationships were accepted by the PPTMs and introduce their properties in details. Finally, we compare the computational power of this model with other classical models; and we prove that the computational power of the proposed model is more than Turing machine and it can compute some problems, which are not computed by Turing machine.
Keywords : Interactive Computation, Permanent Persistent Turing Machine, Persistent Turing Machine, Permanent Recursive Languages, Permanent Recursive Enumerable Languages