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...

In this paper we modify some previous definitions of fuzzy Turing machines to define the notions of accepting and rejecting degrees of inputs, computationally. We use a BFS-based search method and obtain an upper level bound to guarantee the existence of accepting and rejecting degrees. We show that fuzzy, generalized fuzzy and classical Turing machines have the same computational power. Next, ...

In this article we describe a method of translation from a deterministic Turing machine to an extended mH splicing system. The accuracy of this translation is proved by a theorem which shows that the only string present in single copy is a coding of a connguration of the simulated Turing machine. A simpler translation from a universal Turing machine with three tapes to an extended mH system is ...

In this paper several classes of fuzzy functions are studied and related to the computations of a fuzzy Turing machine. These classes are put into relation with the ones previously proposed in the literature.

In this paper we compare computational power of two models of analog and classical computers. As a model of analog computer we use the model proposed by Rubel in 1993 called the Extended Analog Computer (EAC) while as a model of classical computer, the Turing machines. Showing that the Extended Analog Computer can robustly generate result of any Turing machine we use the method of simulation pr...

We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively enumerable (r.e.) sets and universality. FTMs are first regarded as acceptors. It has recently been shown by J. Wiedermann that these machines have more computational power than classical Turing machines. Still, the c...

We consider graph Turing machines, a model of parallel computation on a graph, which provides a natural generalization of several standard computational models, including ordinary Turing machines and cellular automata. In this extended abstract, we give bounds on the computational strength of functions that graph Turing machines can compute. We also begin the study of the relationship between t...

This paper presents a new methodology for executing and adjusting a fuzzy algorithm. It is based on a new concept of fuzzy formal language. The methodology consists of transforming the steps of a fuzzy algorithm into production rules of a fuzzy grammar, executing the algorithm according to the dynamics of this grammar and adjusting its execution using the learning capability of fuzzy formal lan...