Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Structural complexity 1
How we know what technology can do
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Minds and Machines
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Classical computability and fuzzy turing machines
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzy Sets and Systems
Fuzzy and Intuitionistic Fuzzy Turing Machines
Fundamenta Informaticae
| Hi-index | 0.00 |
The first attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical characterization of the computational power of this kind of fuzzy Turing machines. Namely, we will show that fuzzy languages accepted by these machines with a computable t-norm correspond exactly to the union Σ10 ∪ Π10 of recursively enumerable languages and their complements. Moreover, we will show that the class of polynomially time-bounded computations of such machines coincides with the union NP ∪ co-NP of complexity classes from the first level of the polynomial hierarchy.