On the computing power of fuzzy Turing machines
From MaRDI portal
Publication:835106
DOI10.1016/J.FSS.2007.10.013zbMath1186.68193OpenAlexW1999167901MaRDI QIDQ835106
Santiago Figueira, Benjamín René Callejas Bedregal
Publication date: 28 August 2009
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2007.10.013
fuzzy setrecursively enumerable setfuzzy functionuniversal machinecomputable fuzzy functionfuzzy Turing machine
Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10)
Related Items (9)
On typical hesitant fuzzy automata ⋮ Theory of fuzzy computation ⋮ On closure properties of \(\mathcal{L}\)-valued linear languages ⋮ Fuzzy Turing machines: normal form and limitative theorems ⋮ Extension of fuzzy logic operators defined on bounded lattices via retractions ⋮ Automata theory based on complete residuated lattice-valued logic: Turing machines ⋮ Comments on some theories of fuzzy computation ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency ⋮ Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing machines, transition systems, and interaction
- Introduction to the concept of recursiveness of fuzzy functions
- Fuzzy sets and systems. Theory and applications
- Fuzzy subsets: A constructive approach
- Fuzzy and probabilistic programs
- The real number model in numerical analysis
- Fuzzy logic, continuity and effectiveness
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Fuzzy functions and their applications
- Fuzzy function as an approximate solution to a system of fuzzy relation equations
- First course on fuzzy theory and applications.
- Fuzzy logic and arithmetical hierarchy
- Real number computability and domain theory
- On the definitions of computable real continuous functions
- FUZZY RECURSION, RET'S, AND ISOLS
- Quantum theory, the Church–Turing principle and the universal quantum computer
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Effectiveness and multivalued logics
- Fuzzy algorithms
- Fuzzy algorithms
- Statistical Metrics
- Fuzzy logic. Mathematical tools for approximate reasoning
- On a class of fuzzy computable functions
This page was built for publication: On the computing power of fuzzy Turing machines
