Theory of fuzzy computation

It is well known that notions as computability, semi-decidability (recursive enumerability) and decidability are basic for computability theory, formal language theory and formal logic. Therefore, it is natural to put the question of defining the corresponding notions in the framework of fuzzy subset theory. Now, even if the literature on this argument shows strong efforts to find adequate definitions, again there is not a shared and satisfying proposal. So, Syropoulos’ book is welcome since it gives an important contribution in this direction. Indeed, in this book different approaches to fuzzy computability are analysed and compared in a systematic and deep way. Mainly, the book is focused on:

[1]  Jirí Wiedermann,et al.  Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines , 2004, Theor. Comput. Sci..

[2]  Leon Harkleroad Fuzzy Recursion, RET's, and Isols , 1984, Math. Log. Q..

[3]  Lotfi A. Zadeh,et al.  Fuzzy Logic , 2009, Encyclopedia of Complexity and Systems Science.

[4]  Benjamín R. C. Bedregal,et al.  On the computing power of fuzzy Turing machines , 2008, Fuzzy Sets Syst..