Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Introduction to the concept of recursiveness of fuzzy functions
Fuzzy Sets and Systems
Fuzzy subsets: a constructive approach
Fuzzy Sets and Systems
The real number model in numerical analysis
Journal of Complexity
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy logic and arithmetical hierarchy
Fuzzy Sets and Systems
Real number computability and domain theory
Information and Computation
Fuzzy set theory—and its applications (3rd ed.)
Fuzzy set theory—and its applications (3rd ed.)
Computable analysis: an introduction
Computable analysis: an introduction
Fuzzy logic: mathematical tools for approximate reasoning
Fuzzy logic: mathematical tools for approximate reasoning
On a class of fuzzy computable functions
Fuzzy Sets and Systems
An Introduction to Formal Languages and Automata
An Introduction to Formal Languages and Automata
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
First Course On Fuzzy Theory And Applications.
First Course On Fuzzy Theory And Applications.
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Fuzzy and probabilistic programs
Information Sciences: an International Journal
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Extension of fuzzy logic operators defined on bounded lattices via retractions
Computers & Mathematics with Applications
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.22 |
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 context in which this formulation is valid has an unnatural implicit assumption. We settle necessary and sufficient conditions for a language to be r.e., by embedding it in a fuzzy language recognized by a FTM. We do the same thing for n-r.e. set. It is shown that there is no universal fuzzy machine, and ''universality'' is analyzed for smaller classes of FTMs. We argue for a definition of computable fuzzy function, when FTMs are understood as transducers. It is shown that, in this case, our notion of computable fuzzy function coincides with the classical one.