Characterizing the Super-Turing Computing Power and Efficiency of Classical Fuzzy Turing Machines

Number of the records: 1

1.

SYSNO ASEP	0103318
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Characterizing the Super-Turing Computing Power and Efficiency of Classical Fuzzy Turing Machines
Title	Charakterizace super-turingovské výpočetní síly a efektivity klasického fuzzy turingova stroje
Author(s)	Wiedermann, Jiří (UIVT-O)_{RID, SAI, ORCID}
Source Title	Theoretical Computer Science. - : Elsevier - ISSN 0304-3975 Roč. 317, 1-3 (2004), s. 61-69
Number of pages	9 s.
Language	eng - English
Country	NL - Netherlands
Keywords	fuzzy Turing machines ; computability ; computing power ; computing effciency ; Church-Turing thesis
Subject RIV	BA - General Mathematics
R&D Projects	GA201/02/1456 GA ČR - Czech Science Foundation (CSF)
CEZ	AV0Z1030915 - UIVT-O
UT WOS	000221800900004
EID SCOPUS	2442598178
DOI	https://doi.org/10.1016/j.tcs.2003.12.004
Annotation	The first attempts concerning formalization of the notion of fuzzy algorithms in terms of Turing machines are dated in late 1960s when this notion was introduced by Zadeh. Recently, it has been observed that corresponding so-called classical fuzzy Turing machines can solve undecidable problems. In this paper we will give exact recursion-theoretical characterization of the computational power of this kind of fuzzy Turing machines.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2005

Number of the records: 1