Fuzzy algorithms
From MaRDI portal
Publication:5604466
DOI10.1016/S0019-9958(70)80032-8zbMath0205.01303OpenAlexW4213377363WikidataQ56083692 ScholiaQ56083692MaRDI QIDQ5604466
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(70)80032-8
Related Items
On the computing power of fuzzy Turing machines, Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy, Decidability, partial decidability and sharpness relation for L-subsets, Theoretical and linguistic aspects of the fuzzy logic controller, Fuzzy Turing machines: normal form and limitative theorems, Probabilistic automata, A new approach to fuzzy programming, A fuzzy language., Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines, Outline of an approach for the analysis of fuzzy systems, Fuzzy grammars and recursively enumerable fuzzy languages, Fuzzy subsets: A constructive approach, Approximation and universality of fuzzy Turing machines, Automata theory based on complete residuated lattice-valued logic: Turing machines, Fuzzy neural networks, Fixed points, separation, and induced topologies for fuzzy sets, A new approach for the execution and adjustment of a fuzzy algorithm, On a class of fuzzy computable functions, Fuzzy and probabilistic programs, The concept of a linguistic variable and its application to approximate reasoning. I, The concept of a linguistic variable and its application to approximate reasoning. II, The concept of a linguistic variable and its application to approximate reasoning. III, Turing L-machines and recursive computability for L-maps, Comments on some theories of fuzzy computation, A family of fuzzy programming languages, Lattice-valued fuzzy Turing machines: computing power, universality and efficiency, Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
