Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
type: Item
instance of: scholarly article
title: Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
zbMATH Open document ID: 1072.68043
published in: Theoretical Computer Science
publication date: 2004-08-04T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2081197
zbMATH Keywords: Fuzzy Turing machines
zbMATH Keywords: Computability
zbMATH Keywords: Computing power
zbMATH Keywords: Computing efficiency
zbMATH Keywords: Church-Turing thesis
Wikidata QID: Q55933316
author: Jiří Wiedermann
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.12.004
OpenAlex ID: W2026220857
cites work: Q4321931
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Metamathematics of fuzzy logic
cites work: Q4805392
cites work: Q3862379
cites work: Q5573961
cites work: Fuzzy algorithms
cites work: Q2762165
cites work: Q5317671
cites work: Q4437108
DBLP publication ID: journals/tcs/Wiedermann04
DOI: 10.1016/J.TCS.2003.12.004
Recommended article: On the computing power of fuzzy Turing machines
Recommended article: Classical Computability and Fuzzy Turing Machines
Recommended article: Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
Recommended article: Approximation and universality of fuzzy Turing machines
Recommended article: Fuzzy and Intuitionistic Fuzzy Turing Machines
Recommended article: Some improvements in fuzzy turing machines
Recommended article: Q5317671
Recommended article: Q3090176
Recommended article: Q3501145
Recommended article: Fuzzy Turing machines: normal form and limitative theorems
description: scientific article; zbMATH DE number 2081197