Some improvements in fuzzy turing machines

DOI10.22111/IJFS.2019.4483zbMATH Open1429.03148arXiv1707.05311OpenAlexW2962971320MaRDI QIDQ5240884FDOQ5240884

Hadi Farahani

Publication date: 29 October 2019

Abstract: In this paper, we modify some previous definitions of fuzzy Turing machines to define the notions of accepting and rejecting degrees of inputs, computationally. We use a BFS-based search method and obtain an upper level bound to guarantee the existence of accepting and rejecting degrees. We show that fuzzy, generalized fuzzy and classical Turing machines have the same computational power. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy states. These machines are used to catch some types of loops of the classical Turing machines. Moreover, to each r.e. or co-r.e language, we correspond a fuzzy language which is indeterminable by an extended fuzzy Turing machine.

Full work available at URL: https://arxiv.org/abs/1707.05311

zbMATH Keywords

theory of computationhalting problemextended fuzzy Turing machineindeterminacy state

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Cited In (3)

• On the computing power of fuzzy Turing machines
• Computation of the fifth Geometric-Arithmetic Index for Polycyclic Aromatic Hydrocarbons PAH _k
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines

This page was built for publication: Some improvements in fuzzy turing machines

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