Comments on some theories of fuzzy computation
@article{Gerla2016CommentsOS, title={Comments on some theories of fuzzy computation}, author={Giangiacomo Gerla}, journal={International Journal of General Systems}, year={2016}, volume={45}, pages={372 - 392} }
In classical computability theory, there are several (equivalent) definitions of computable function, decidable subset and semi-decidable subset. This paper is devoted to the discussion of some proposals for extending these definitions to the framework of fuzzy set theory. The paper mainly focuses on the notions of fuzzy Turing machine and fuzzy computability by limit processes. The basic idea of this paper is that the presence of real numbers in the interval [0,1] forces us to refer to endless… CONTINUE READING
Topics from this paper
4 Citations
Fuzzy Turing machines: Normal form and limitative theorems
- Mathematics, Computer Science
- Fuzzy Sets Syst.
- 2018
- 1
Improvement of the Service Quality Management System in Automobile Dealerships Using Dynamic Fuzzy Numbers Tools
- Computer Science
- 2020 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon)
- 2020
References
SHOWING 1-10 OF 23 REFERENCES
Decidability, Recursive Enumerability and Kleene Hierarchy For L-Subsets
- Mathematics, Computer Science
- Math. Log. Q.
- 1989
- 10
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Computer Science
- Theor. Comput. Sci.
- 2004
- 40
- PDF
On the computing power of fuzzy Turing machines
- Computer Science
- Fuzzy Sets Syst.
- 2008
- 28
- Highly Influential
- PDF
Fuzzy and Intuitionistic Fuzzy Turing Machines
- Mathematics, Computer Science
- Fundam. Informaticae
- 2013
- 9
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
- Mathematics, Computer Science
- Fuzzy Sets Syst.
- 2009
- 10