Fuzzy Turing machines: Normal form and limitative theorems

@article{Gerla2018FuzzyTM,
  title={Fuzzy Turing machines: Normal form and limitative theorems},
  author={Giangiacomo Gerla},
  journal={Fuzzy Sets Syst.},
  year={2018},
  volume={333},
  pages={87-105}
}
Abstract A normal form for fuzzy Turing machines is proposed and examined. This normal form is arithmetical in nature since the truth values are substituted by n -ples of natural numbers and the operation interpreting the conjunction becomes a sort of truncated sum. Also, some of the results in the paper enable us to emphasize the inadequacy of the notion of fuzzy Turing machine for fuzzy computability, i.e. that this notion is not a good candidate for a ‘Church thesis’ in the fuzzy mathematics… Expand
1 Citations
Comprehensive Fuzzy Turing Machines, An Evolution to the Concept of Finite State Machine Control
  • PDF

References

SHOWING 1-10 OF 23 REFERENCES
Fuzzy Turing Machines Revised
  • 24
Comments on some theories of fuzzy computation
  • 4
On the computing power of fuzzy Turing machines
  • 28
  • PDF
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
  • Y. Li
  • Mathematics, Computer Science
  • Fuzzy Sets Syst.
  • 2009
  • 10
Fuzzy logic programming
  • P. Vojtás
  • Mathematics, Computer Science
  • Fuzzy Sets Syst.
  • 2001
  • 190
Theory of Fuzzy Computation
  • 9
Fuzzy logic, continuity and effectiveness
  • 70
  • PDF
...
1
2
3
...