Pages that link to "Item:Q1434368"
From MaRDI portal
The following pages link to Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines (Q1434368):
Displaying 12 items.
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Approximation and universality of fuzzy Turing machines (Q954457) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Fuzzy Turing machines: normal form and limitative theorems (Q1697984) (← links)
- On typical hesitant fuzzy automata (Q2153652) (← links)
- Comments on some theories of fuzzy computation (Q2817095) (← links)
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata (Q2866110) (← links)
- Theory of fuzzy computation (Q2943497) (← links)
- Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines (Q5158665) (← links)
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages (Q5275234) (← links)
