Advertisement

Artificial Life and Robotics

, Volume 15, Issue 2, pp 212–215 | Cite as

Parallel Turing machines on four-dimensional input tapes

  • Takao ItoEmail author
  • Makoto Sakamoto
  • Ayumi Taniue
  • Tomoya Matsukawa
  • Yasuo Uchida
  • Hiroshi Furutani
  • Michio Kono
Original Article

Abstract

The parallel Turing machine (PTM) proposed by Wiedermann is a set of identical usual sequential Turing machines (STMs) cooperating on two common tapes: storage tape and input tape. On the other hand, due to the advances in many application areas such as motion picture processing, computer animation, virtual reality systems, and so forth, it has become increasingly apparent that the study of four-dimensional patterns is of crucial importance. Therefore, we think that the study of four-dimensional automata as a computational model of four-dimensional pattern processing is also meaningful. In this article, we propose a four-dimensional parallel Turing machine (4-PTM), and investigate some of its properties based on hardware complexity.

Key words

Computational complexity Four-dimensional automaton Hardware-bounded computation Parallel Turing machine Space constructability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wiedermann J (1984) Parallel Turing machines. Technical Report RUU-CS-84-11, Department of Computer Science, University of Utrecht, The NetherlandsGoogle Scholar
  2. 2.
    Ito T (2008) Synchronized alternation and parallelism for three-dimensional automata. PhD Thesis, University of MiyazakiGoogle Scholar
  3. 3.
    Okinaka K, Inoue K, Ito A, et al (2002) A note on hardware-bounded parallel Turing machines. Proceedings of the 2nd International Conference on Information, Beijing, China, pp 90–100Google Scholar
  4. 4.
    Sakurayama S, Inoue K, Takanami I, et al (1983) A note on multihead on-line Turing machines. Tech Rep Yamaguchi Univ 3(2): 183–192Google Scholar
  5. 5.
    Rosenberg AL (1996) On multihead finite automata. IBM J Res Dev 10:388–394CrossRefGoogle Scholar
  6. 6.
    Yao AC, Rivest RL (1978) k + 1 heads are better than k. J ACM 25(2):337–340zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Sakamoto M, Inoue K, Takanami I (1994) Three-dimensionally fully space constructible functions. IECE Trans Inf Syst E77-D(6): 723–725MathSciNetGoogle Scholar

Copyright information

© International Symposium on Artificial Life and Robotics (ISAROB). 2010

Authors and Affiliations

  • Takao Ito
    • 1
    Email author
  • Makoto Sakamoto
    • 2
  • Ayumi Taniue
    • 2
  • Tomoya Matsukawa
    • 2
  • Yasuo Uchida
    • 1
  • Hiroshi Furutani
    • 2
  • Michio Kono
    • 2
  1. 1.Department of Business AdministrationUbe National College of TechnologyUbeJapan
  2. 2.Department of Computer Science and Systems EngineeringUniversity of MiyazakiMiyazakiJapan

Personalised recommendations