Turing L -machines and recursive computability for L -maps

Studia Logica 48 (2):179 - 192 (1989)
Abstract
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.1007/BF02770511
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA
Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.
Fuzzy Recursion, Ret's, and Isols.Leon Harkleroad - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (26‐29):425-436.
Fuzzy Sets.Lofti A. Zadeh - 1965 - Information and Control 8 (1):338--53.

Add more references

Citations of this work BETA
Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (1):49-62.

Add more citations

Similar books and articles
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Alan Turing and the Foundations of Computable Analysis.Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (3):394-430.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.

Monthly downloads

Added to index

2009-01-28

Total downloads

15 ( #309,002 of 2,153,858 )

Recent downloads (6 months)

1 ( #398,274 of 2,153,858 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums