scientific article; zbMATH DE number 2206366
From MaRDI portal
Publication:5317671
Recommendations
Cited in
(14)- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Fuzzy Turing machines: normal form and limitative theorems
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
- Meta-logic programming for a synonymy logic
- On a restricted universal fuzzy Turing machine
- Classical Computability and Fuzzy Turing Machines
- Computing power of Turing machines in the framework of unsharp quantum logic
- Some improvements in fuzzy Turing machines
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
- Fuzzy and intuitionistic fuzzy Turing machines
- How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- On the computing power of fuzzy Turing machines
- Approximation and universality of fuzzy Turing machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317671)
