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
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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Information and Computation
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Turing machines, transition systems, and interaction
Information and Computation
Fuzzy and probabilistic programs
Information Sciences: an International Journal
Hi-index | 0.00 |
We work with fuzzy Turing machines (ftms) and we study the relationship between this computational model and classical recursion concepts such as computable functions, r.e. sets and universality. ftms are first regarded as acceptors. It has recently been shown in [23] 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 and we do the same thing for difference r.e. sets, a class of “harder” sets in terms of computability. It is also shown that there is no universal ftm. We also 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.