Introduction to the concept of recursiveness of fuzzy functions
From MaRDI portal
Publication:1100197
DOI10.1016/0165-0114(87)90131-XzbMath0639.03044OpenAlexW1989564131MaRDI QIDQ1100197
Publication date: 1987
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-0114(87)90131-x
Fuzzy logic; logic of vagueness (03B52) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (5)
On the computing power of fuzzy Turing machines ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ On a class of fuzzy computable functions ⋮ A family of fuzzy programming languages ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to fuzzy programming
- General recursive functions of natural numbers
- Fuzzy algorithms
- On the Execution of Fuzzy Programs Using Finite-State Machines
- Computability by Probabilistic Turing Machines
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: Introduction to the concept of recursiveness of fuzzy functions
