We first show that for space smaller than log m, five-way three-dimensional alternating Turing machines are less powerful than six-way three-dimensional ...
A note on three-dimensional alternating Turing machines with space smaller than log m. Authors: Makoto Sakamoto. Makoto Sakamoto. View Profile. , Katsushi Inoue.
People also ask
What is the time and space complexity of a Turing machine?
What is multidimensional Turing machine?
Three-Dimensional Alternating Turing Machines with Only Universal ...
www.semanticscholar.org › paper
A note on three-dimensional alternating Turing machines with space smaller than log m · M. SakamotoKatsushi InoueI. Takanami. Computer Science, Mathematics.
A note on three-dimensional alternating Turing machines with space smaller than log m ... than six-way three-dimensional alternating Turing machines. We ...
The main purpose of this paper is to present a technique which we can show that some three-dimensional language is not accepted by any space-bounded three- ...
Mar 6, 2016 · We first show that for space smaller than log m, five-way three-dimensional alternating Turing machines are less powerful than six-way three- ...
A note on three-dimensional alternating Turing machines with space smaller than log m · Computer Science, Mathematics. Inf. Sci. · 1993.
Morita et al. proposed an L(m, n) space-bounded two-dimensional Turing machine. and its variants to formalize memory limited computations in the two ...
Takanami, “A note on three-dimensional alternating Turing machines with space smaller than log m”, Infor- ... Sakamoto, “Three-dimensional alternating. Turing ...
This paper tries to fully characterize the properties and relationships of space classes defined by Turing machines (TMs) that use less than logarithmic space—
Missing: smaller | Show results with:smaller