Araştırma Makalesi
BibTex RIS Kaynak Göster

Permanent Persistent Turing Machine: A new Model for Interactive Computation

Yıl 2018, Cilt: 15 Sayı: 1, - , 30.05.2018

Öz

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 (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.


Kaynakça

  • [1] Goldin, Dina, Scott A. Smolka, and Peter Wegner, eds. Interactive computation: The new paradigm. Springer Science & Business Media, 2006.
  • [2] Goldin, Dina Q., Scott A. Smolka, Paul C. Attie, and Elaine L. Sonderegger. "Turing machines, transition systems, and interaction." Information and Computation 194, no. 2 (2004): 101-128.
  • [3] Wegner, Peter. "Interactive foundations of computing." Theoretical computer science 192, no. 2 (1998): 315-351.
  • [4] Syropoulos, Apostolos. Hypercomputation: computing beyond the Church-Turing barrier. Springer Science & Business Media, 2008.
  • [5] Goldin, Dina Q. "Persistent Turing machines as a model of interactive computation." In International Symposium on Foundations of Information and Knowledge Systems, pp. 116-135. Springer, Berlin, Heidelberg, 2000.
  • [6] Wegner, Peter. "Interactive foundations of computing." Theoretical computer science 192, no. 2 (1998): 315-351.
  • [7] Cooper, B. S. "Computability Theory. Chapman Hall/Crc Mathematics Series." (2003).
  • [8] Davis, Martin, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages: fundamentals of theoretical computer science. Newnes, 1994.
  • [9] Ord, Toby. "Hypercomputation: computing more than the Turing machine." arXiv preprint math/0209332 (2002).
  • [10] Copeland, B. Jack. "The church-turing thesis." Stanford encyclopedia of philosophy (2002).
  • [11] Kolan, Amy J. "Interactive Computation for Undergraduates: The Next Generation." Journal of Statistical Physics 167, no. 3-4 (2017): 997-1006.
  • [12] Kosub, Sven. Persistent computations. Inst. für Informatik, 1998.
  • [13] Luttik, Bas, and Fei Yang. "On the Executability of Interactive Computation." In Conference on Computability in Europe, pp. 312-322. Springer International Publishing, 2016.
Yıl 2018, Cilt: 15 Sayı: 1, - , 30.05.2018

Öz

Kaynakça

  • [1] Goldin, Dina, Scott A. Smolka, and Peter Wegner, eds. Interactive computation: The new paradigm. Springer Science & Business Media, 2006.
  • [2] Goldin, Dina Q., Scott A. Smolka, Paul C. Attie, and Elaine L. Sonderegger. "Turing machines, transition systems, and interaction." Information and Computation 194, no. 2 (2004): 101-128.
  • [3] Wegner, Peter. "Interactive foundations of computing." Theoretical computer science 192, no. 2 (1998): 315-351.
  • [4] Syropoulos, Apostolos. Hypercomputation: computing beyond the Church-Turing barrier. Springer Science & Business Media, 2008.
  • [5] Goldin, Dina Q. "Persistent Turing machines as a model of interactive computation." In International Symposium on Foundations of Information and Knowledge Systems, pp. 116-135. Springer, Berlin, Heidelberg, 2000.
  • [6] Wegner, Peter. "Interactive foundations of computing." Theoretical computer science 192, no. 2 (1998): 315-351.
  • [7] Cooper, B. S. "Computability Theory. Chapman Hall/Crc Mathematics Series." (2003).
  • [8] Davis, Martin, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages: fundamentals of theoretical computer science. Newnes, 1994.
  • [9] Ord, Toby. "Hypercomputation: computing more than the Turing machine." arXiv preprint math/0209332 (2002).
  • [10] Copeland, B. Jack. "The church-turing thesis." Stanford encyclopedia of philosophy (2002).
  • [11] Kolan, Amy J. "Interactive Computation for Undergraduates: The Next Generation." Journal of Statistical Physics 167, no. 3-4 (2017): 997-1006.
  • [12] Kosub, Sven. Persistent computations. Inst. für Informatik, 1998.
  • [13] Luttik, Bas, and Fei Yang. "On the Executability of Interactive Computation." In Conference on Computability in Europe, pp. 312-322. Springer International Publishing, 2016.
Toplam 13 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Bölüm Makaleler
Yazarlar

Sepehr Ebrahimi Mood Bu kişi benim

Mohammad Masoud Javidi

Yayımlanma Tarihi 30 Mayıs 2018
Yayımlandığı Sayı Yıl 2018 Cilt: 15 Sayı: 1

Kaynak Göster

APA Mood, S. E., & Javidi, M. M. (2018). Permanent Persistent Turing Machine: A new Model for Interactive Computation. Cankaya University Journal of Science and Engineering, 15(1).
AMA Mood SE, Javidi MM. Permanent Persistent Turing Machine: A new Model for Interactive Computation. CUJSE. Mayıs 2018;15(1).
Chicago Mood, Sepehr Ebrahimi, ve Mohammad Masoud Javidi. “Permanent Persistent Turing Machine: A New Model for Interactive Computation”. Cankaya University Journal of Science and Engineering 15, sy. 1 (Mayıs 2018).
EndNote Mood SE, Javidi MM (01 Mayıs 2018) Permanent Persistent Turing Machine: A new Model for Interactive Computation. Cankaya University Journal of Science and Engineering 15 1
IEEE S. E. Mood ve M. M. Javidi, “Permanent Persistent Turing Machine: A new Model for Interactive Computation”, CUJSE, c. 15, sy. 1, 2018.
ISNAD Mood, Sepehr Ebrahimi - Javidi, Mohammad Masoud. “Permanent Persistent Turing Machine: A New Model for Interactive Computation”. Cankaya University Journal of Science and Engineering 15/1 (Mayıs 2018).
JAMA Mood SE, Javidi MM. Permanent Persistent Turing Machine: A new Model for Interactive Computation. CUJSE. 2018;15.
MLA Mood, Sepehr Ebrahimi ve Mohammad Masoud Javidi. “Permanent Persistent Turing Machine: A New Model for Interactive Computation”. Cankaya University Journal of Science and Engineering, c. 15, sy. 1, 2018.
Vancouver Mood SE, Javidi MM. Permanent Persistent Turing Machine: A new Model for Interactive Computation. CUJSE. 2018;15(1).