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

DOI10.1016/J.TCS.2003.12.004MaRDI QIDQ1434368zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jiří 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

Church-Turing thesisComputabilityComputing efficiencyComputing powerFuzzy Turing machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)

Recommendations

• On the computing power of fuzzy Turing machines
• Classical Computability and Fuzzy Turing Machines
• Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
• Approximation and universality of fuzzy Turing machines
• Fuzzy and intuitionistic fuzzy Turing machines
• Some improvements in fuzzy Turing machines
• scientific article; zbMATH DE number 2206366
• scientific article; zbMATH DE number 5943774
• On a restricted universal fuzzy Turing machine
• Fuzzy Turing machines: normal form and limitative theorems

Cites work

• scientific article; zbMATH DE number 1687054 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 719756 (Why is no real title available?)
• scientific article; zbMATH DE number 2013816 (Why is no real title available?)
• scientific article; zbMATH DE number 1909830 (Why is no real title available?)
• scientific article; zbMATH DE number 2206366 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Fuzzy algorithms
• Fuzzy algorithms
• Metamathematics of fuzzy logic
• Quantum theory, the Church–Turing principle and the universal quantum computer

Cited in

(13)

• On typical hesitant fuzzy automata
• Comments on some theories of fuzzy computation
• Approximation and universality of fuzzy Turing machines
• Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
• Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
• Automata theory based on complete residuated lattice-valued logic: Turing machines
• Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
• Fuzzy Turing machines: normal form and limitative theorems
• Theory of fuzzy computation
• On the computing power of fuzzy Turing machines
• Circular interval-valued computers and simulation of (red-green) Turing machines
• Weighted automata and logics meet computational complexity
• Computing power of Turing machines in the framework of unsharp quantum logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434368)