Abstract
Informally, the parallel Turing machine (PTM) proposed by Wiedermann is a set of identical usual sequential Turing machines (STMs) cooperating on two common tapes: a storage tape and an input tape. Moreover, STMs which represent the individual processors of a parallel computer can multiply themselves in the course of computation. On the other hand, during the past 7 years or so, automata on a four-dimensional tape have been proposed as computational models of four-dimensional pattern processing, and several properties of such automata have been obtained. We proposed a four-dimensional parallel Turing machine (4-PTM), and dealt with a hardware-bounded 4-PTM in which each side-length of each input tape is equivalent. We believe that this machine is useful in measuring the parallel computational complexity of three-dimensional images. In this work, we continued the study of the 3-PTM, in which each side-length of each input tape is equivalent, and investigated some of its accepting powers.
This is a preview of subscription content, log in via an institution to check access.
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
Sakamoto M, Ito T, Furutani H, Kono M (2008) Some accepting powers of three-dimensional parallel Turing machines. Artif Life Robotics 13(1):27–30
Sakamoto M, Tomozoe N, Furutani H, et al (2008) A survey of automata on three-dimensional input tapes. WSEAS Trans Comput 7(10):1638–1647
Okabe H, Taniguchi S, Makino T, et al (2003) Computation for motion image processing by 4-dimensional alternating Turing machines. Proceedings of the 7th World Multiconference on SCI, Orlando, USA, pp 241–246
Sakamoto M, Okabe H, Inoue K (2002) Some properties of four-dimensional finite automata. 2002 Chugoku-Section Joint Convention Record of Institutes of Electrical and Information Engineering, Shimane, Japan, p 351
Ito T, Sakamoto M, Nagamizu Y, et al (2010) Four-dimensional parallel Turing machines. Proceedings of the 15th International Symposium on Artificial Life and Robotics, Oita, Japan
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
Uchida, Y., Sakamoto, M., Taniue, A. et al. Some properties of four-dimensional parallel Turing machines. Artif Life Robotics 15, 385–388 (2010). https://doi.org/10.1007/s10015-010-0793-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-010-0793-8