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.
Similar content being viewed by others
References
Wiedermann J (1984) Parallel Turing machines. Technical Report RUU-CS-84-11, Department of Computer Science, University of Utrecht, The Netherlands
Ito T (2008) Synchronized alternation and parallelism for three-dimensional automata. PhD Thesis, University of Miyazaki
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–100
Sakurayama S, Inoue K, Takanami I, et al (1983) A note on multihead on-line Turing machines. Tech Rep Yamaguchi Univ 3(2): 183–192
Rosenberg AL (1996) On multihead finite automata. IBM J Res Dev 10:388–394
Yao AC, Rivest RL (1978) k + 1 heads are better than k. J ACM 25(2):337–340
Sakamoto M, Inoue K, Takanami I (1994) Three-dimensionally fully space constructible functions. IECE Trans Inf Syst E77-D(6): 723–725
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was presented in part at the 15th International Symposium on Artificial Life and Robotics, Oita, Japan, February 4–6, 2010
About this article
Cite this article
Ito, T., Sakamoto, M., Taniue, A. et al. Parallel Turing machines on four-dimensional input tapes. Artif Life Robotics 15, 212–215 (2010). https://doi.org/10.1007/s10015-010-0798-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-010-0798-3