Turing L-machines and recursive computability for L-maps (Q1263577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Recursively EnumerableL-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharpness relation and decidable fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pavelka's Fuzzy Logic and Free L‐Subsemigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability, partial decidability and sharpness relation for L-subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: FUZZY RECURSION, RET'S, AND ISOLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy and probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy algorithms / rank
 
Normal rank

Revision as of 11:54, 20 June 2024

scientific article
Language Label Description Also known as
English
Turing L-machines and recursive computability for L-maps
scientific article

    Statements

    Turing L-machines and recursive computability for L-maps (English)
    0 references
    0 references
    0 references
    1989
    0 references
    This paper's author and the reviewer have - working independently, but using similar approaches - investigated the fuzzification of recursion theory. Earlier work by Santos on fuzzy algorithms followed a different approach. This paper ties the two strands of thought together. Specifically, two definitions (one weaker, one stronger) of p.r. fuzzy map are given in the vein of the author's previous work. Properties of such maps are then investigated, in particular their relations to Santos' fuzzy Turing machines.
    0 references
    0 references
    partial recursive fuzzy map
    0 references
    fuzzification of recursion theory
    0 references
    fuzzy Turing machines
    0 references