On a class of fuzzy computable functions

DOI10.1016/S0165-0114(00)00014-2zbMath0983.03034OpenAlexW2164692148MaRDI QIDQ5947561

Rafael Morales-Bueno, Ricardo Conejo, José-Luis Pérez-de-la-Cruz, Francisco Trigueor-Ruiz

Publication date: 17 April 2002

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-0114(00)00014-2

zbMATH Keywords

fuzzy languagesfuzzy relationsfuzzy computabilityfuzzy programming languagefuzzy Turing machines

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Theory of programming languages (68N15) Turing machines and related notions (03D10)

Related Items (3)

On the computing power of fuzzy Turing machines ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages

Cites Work

• Unnamed Item
• Unnamed Item
• Introduction to the concept of recursiveness of fuzzy functions
• Fuzzy subsets: A constructive approach
• Turing L-machines and recursive computability for L-maps
• A family of fuzzy programming languages
• Classical recursion theory. Vol. II
• FUZZY RECURSION, RET'S, AND ISOLS
• Flow diagrams, turing machines and languages with only two formation rules
• Fuzzy algorithms

This page was built for publication: On a class of fuzzy computable functions