Turing L-machines and recursive computability for L-maps

DOI10.1007/BF02770511zbMath0688.03025OpenAlexW2006564687MaRDI QIDQ1263577

Giangiacomo Gerla

Publication date: 1989

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02770511

zbMATH Keywords

fuzzy Turing machinesfuzzification of recursion theorypartial recursive fuzzy map

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items

Fuzzy grammars and recursively enumerable fuzzy languages, Fuzzy subsets: A constructive approach, On a class of fuzzy computable functions, A family of fuzzy programming languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability, partial decidability and sharpness relation for L-subsets
• Fuzzy and probabilistic programs
• L-fuzzy sets
• FUZZY RECURSION, RET'S, AND ISOLS
• Pavelka's Fuzzy Logic and Free L‐Subsemigroups
• Recursively EnumerableL-Sets
• On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
• Sharpness relation and decidable fuzzy sets
• Fuzzy sets
• Fuzzy algorithms
• Fuzzy algorithms