In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

A string Turing machine is a variant of a Turing machine designed for easy manipulation of strings. In contrast to the standard Turing machine, a string Turing machine can insert and delete squares on the tape. It is easy to see that the models of standard and string Turing machines are equivalent in computing power. However, in case of the string Turing machine, imposing certain restrictions o...

In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.

This paper first proves the Savitch Theorem: any nondeterminstic L(n)− tape bounded Turing Machine can be simulated by a deterministic [L(n)]− tape bounded Turing machine, provided L(n) ≥ log2n. Then as an attempt to answer the following question: “Given a nondeterministic tape bounded Turing machine which accepts set A, how much additional storage does a deterministic Turing machine require to...

We present a small time-efficient universal Turing machine with 5 states and 6 symbols. This Turing machine simulates our new variant of tag system. It is the smallest known universal Turing machine that simulates Turing machine computations in polynomial time.

Turing machine space complexity is related to circuit depth complexity. The relationship complements the known connection between Turing machine time and circuit size, thus enabling us to expose the related nature of some important open problems concerning Turing machine and circuit complexity. We are also able to show some connection between Turing machine complexity and arithmetic complexity.