- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
TuringL-machines and recursive computability forL-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.Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
Recursiveness of ω‐Operations.Victor L. Selivanov - 1994 - Mathematical Logic Quarterly 40 (2):204-206.
Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
The Development of Ideas on Computable Intelligence.Yinsheng Zhang - 2017 - Journal of Human Cognition 1 (1):97-108.
The Computation of Partial Recursive Word‐Functions Without Read Instructions.Holger Petersen - 1996 - Mathematical Logic Quarterly 42 (1):312-318.
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.
Analytics
Added to PP
2009-01-28
Downloads
54 (#402,993)
6 months
11 (#356,365)
2009-01-28
Downloads
54 (#402,993)
6 months
11 (#356,365)
Historical graph of downloads
Author's Profile
Citations of this work
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi.Jan Pavelka - 1979 - Mathematical Logic Quarterly 25 (7-12):119-134.
Decidability, partial decidability and sharpness relation for l-subsets.Giangiacomo Gerla - 1987 - Studia Logica 46 (3):227-238.
Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-f5f4x uwo