Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines

DOI10.1016/j.tcs.2003.12.004zbMath1072.68043OpenAlexW2026220857WikidataQ55933316 ScholiaQ55933316MaRDI QIDQ1434368

Juraj Wiedermann

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.004

zbMATH Keywords

ComputabilityChurch-Turing thesisComputing efficiencyComputing powerFuzzy Turing machines

Mathematics Subject Classification ID

Related Items (12)

On the computing power of fuzzy Turing machines ⋮ On typical hesitant fuzzy automata ⋮ Theory of fuzzy computation ⋮ Fuzzy Turing machines: normal form and limitative theorems ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines ⋮ Approximation and universality of fuzzy Turing machines ⋮ 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 ⋮ Recursively Generated Evolutionary Turing Machines and Evolutionary Automata ⋮ 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
• Metamathematics of fuzzy logic
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Fuzzy algorithms
• Fuzzy algorithms

This page was built for publication: Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines