TuringL-machines and recursive computability forL-maps

Studia Logica 48 (2):179-192 (1989)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1007/bf02770511

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Turing L -machines and recursive computability for L -maps.Giangiacomo Gerla - 1989 - Studia Logica 48 (2):179 - 192.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
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.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
The Computation of Partial Recursive Word‐Functions Without Read Instructions.Holger Petersen - 1996 - Mathematical Logic Quarterly 42 (1):312-318.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Turing-, human- and physical computability: An unasked question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.

Analytics

Added to PP
2016-02-04

Downloads
8 (#1,334,002)

6 months
6 (#566,625)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Fuzzy Sets.Lofti A. Zadeh - 1965 - Information and Control 8 (1):338--53.

View all 11 references / Add more references