Approximation and universality of fuzzy Turing machines
type: Item
instance of: scholarly article
title: Approximation and universality of fuzzy Turing machines
zbMATH Open document ID: 1151.68011
published in: Science in China. Series F
publication date: 2008-11-10T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03E72
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5363738
zbMATH Keywords: fuzzy Turing machine
zbMATH Keywords: fuzzy recursively enumerable language
zbMATH Keywords: fuzzy recursive language
zbMATH Keywords: universal fuzzy Turing machine
zbMATH Keywords: fuzzy algorithm
author: Yongming Li
MaRDI profile type: Publication
full work available at URL: s11432-008-0089-y
OpenAlex ID: W2164645885
Wikidata QID: Q62038214
cites work: Fuzzy algorithms
cites work: Q4791753
cites work: Deterministic Acceptors of Regular Fuzzy Languages
cites work: A new approach for the execution and adjustment of a fuzzy algorithm
cites work: Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
cites work: Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
cites work: Q4367944
cites work: Q4210639
cites work: Metamathematics of fuzzy logic
cites work: Q3862379
cites work: Quantum Complexity Theory
cites work: Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
cites work: Approximation and robustness of fuzzy finite automata
cites work: Triangular norms
cites work: An approach to measure the robustness of fuzzy reasoning
cites work: Arithmetical complexity of fuzzy predicate logics -- a survey
cites work: Complexity issues in Basic Logic
DOI: 10.1007/S11432-008-0089-Y
description: scientific article; zbMATH DE number 5363738