Skip to main content
SpringerLink
Log in

Some accepting powers of three-dimensional parallel Turing machines

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

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: storage tape and 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 25 years or so, automata on a three-dimensional tape have been proposed as computational models of three-dimensional pattern processing, and several properties of such automata have been obtained. We proposed a three-dimensional parallel Turing machine (3-PTM),1 and dealt with a hardware-bounded 3-PTM whose inputs are restricted to cubic ones. We believe that this machine is useful in measuring the parallel computational complexity of three-dimensional images. Here, we continue the study of 3-PTM, whose inputs are restricted to cubic ones, and investigate some of its accepting powers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ito T, Sakamoto M, Nagamizu Y, et al (2007) Three-dimensional parallel Turing machines. In: Proceedings of the 12th international symposium on artifical life and robotics, Oita, Japan, pp 131–134

  2. Wiedermann J (1984) Parallel Turing machines. Technical Report RUU-CS-84-11, Department of Computer Science, University of Utrecht, The Netherlands

    Google Scholar 

  3. Okinaka K, Inoue K, Ito A, et al (2002) A note on hardwarebounded parallel Turing machines. In: Proceedings of the 2nd international conference on information, Beijing, China, pp 90–100

  4. Sakamoto M (1999) Three-dimensional alternating Turing machines. PhD Thesis, Yamaguchi University

  5. Sakamoto M, Ito T, Tomozoe N, et al (2007) A survey of threed-imensional automata. Papers of The Technical Meeting on Information Systems, IEEE, Japan, IS-07-12, pp 11–17

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems Engineering, University of Miyazaki, Miyazaki, 889-2192, Japan

    Makoto Sakamoto

  2. Department of Business Administration, Ube National College of Technology, Ube, Japan

    Takao Ito, Hiroshi Furutani & Michio Kono

Authors
  1. Makoto Sakamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takao Ito
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Furutani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michio Kono
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Makoto Sakamoto.

Additional information

This work was presented in part at the First European Workshop on Artificial Life and Robotics, Vienna, Austria, July 12–13, 2007

About this article

Cite this article

Sakamoto, M., Ito, T., Furutani, H. et al. Some accepting powers of three-dimensional parallel Turing machines. Artif Life Robotics 13, 27–30 (2008). https://doi.org/10.1007/s10015-008-0511-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-008-0511-y

Key words

Search

Navigation