On a class of fuzzy computable functions
From MaRDI portal
This paper proposes a notion of fuzzy computability that is more restrictive than some other formalizations of this concept that have appeared in the literature. The authors' definition uses fuzzy Turing machines, with a finitariness condition imposed on the computations. The class of functions obtained by the authors is then characterized by them in terms of a fuzzy programming language they had introduced in previous papers.
Recommendations
Cites work
- A family of fuzzy programming languages
- Classical recursion theory. Vol. II
- Flow diagrams, turing machines and languages with only two formation rules
- Fuzzy algorithms
- FUZZY RECURSION, RET'S, AND ISOLS
- Fuzzy subsets: A constructive approach
- scientific article; zbMATH DE number 3887668 (Why is no real title available?)
- scientific article; zbMATH DE number 43004 (Why is no real title available?)
- Introduction to the concept of recursiveness of fuzzy functions
- Turing L-machines and recursive computability for L-maps
Cited in
(6)- Introduction to the concept of recursiveness of fuzzy functions
- Fuzzy subsets: A constructive approach
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- Theory of fuzzy computation
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- On the computing power of fuzzy Turing machines
This page was built for publication: On a class of fuzzy computable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5947561)