Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
An elementary fuzzy programming language
Fuzzy Sets and Systems
A course in fuzzy systems and control
A course in fuzzy systems and control
SIAM Journal on Computing
A new approach for the execution and adjustment of a fuzzy algorithm
Fuzzy Sets and Systems
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
A probabilistic model of computing with words
Journal of Computer and System Sciences
Complexity issues in basic logic
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Arithmetical complexity of fuzzy predicate logics – a survey
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Artificial Intelligence
On the computing power of fuzzy Turing machines
Fuzzy Sets and Systems
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A formal model of computing with words
IEEE Transactions on Fuzzy Systems
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Fuzzy Turing Machines: Variants and Universality
IEEE Transactions on Fuzzy Systems
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.20 |
In this paper we study fuzzy Turing machines with membership degrees in distributive lattices, which we called them lattice-valued fuzzy Turing machines. First we give several formulations of lattice-valued fuzzy Turing machines, including in particular deterministic and non-deterministic lattice-valued fuzzy Turing machines (l-DTMcs and l-NTMs). We then show that l-DTMcs and l-NTMs are not equivalent as the acceptors of fuzzy languages. This contrasts sharply with classical Turing machines. Second, we show that lattice-valued fuzzy Turing machines can recognize n-r.e. sets in the sense of Bedregal and Figueira, the super-computing power of fuzzy Turing machines is established in the lattice-setting. Third, we show that the truth-valued lattice being finite is a necessary and sufficient condition for the existence of a universal lattice-valued fuzzy Turing machine. For an infinite distributive lattice with a compact metric, we also show that a universal fuzzy Turing machine exists in an approximate sense. This means, for any prescribed accuracy, there is a universal machine that can simulate any lattice-valued fuzzy Turing machine on it with the given accuracy. Finally, we introduce the notions of lattice-valued fuzzy polynomial time-bounded computation (lP) and lattice-valued non-deterministic fuzzy polynomial time-bounded computation (lNP), and investigate their connections with P and NP. We claim that lattice-valued fuzzy Turing machines are more efficient than classical Turing machines.