Turing L -machines and recursive computability for L -maps

Studia Logica 48 (2):179 - 192 (1989)
We propose the notion of partial recursiveness and strong partial recursiveness for fuzzy maps. We prove that a fuzzy map f is partial recursive if and only if it is computable by a Turing fuzzy machine and that f is strongly partial recursive and deterministic if and only if it is computable via a deterministic Turing fuzzy machine. This gives a simple and manageable tool to investigate about the properties of the fuzzy machines
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/20015425
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Loredana Biacino & Giangiacomo Gerla (1987). Recursively Enumerable L‐Sets. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.
Leon Harkleroad (1984). Fuzzy Recursion, Ret's, and Isols. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (26‐29):425-436.
Lofti A. Zadeh (1965). Fuzzy Sets. Information and Control 8 (1):338--53.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

12 ( #205,927 of 1,726,249 )

Recent downloads (6 months)

3 ( #231,316 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.