|
![]() |
|||
|
||||
OverviewThe book provides the first full length exploration of fuzzy computability. It describes the notion of fuzziness and present the foundation of computability theory. It then presents the various approaches to fuzzy computability. This text provides a glimpse into the different approaches in this area, which is important for researchers in order to have a clear view of the field. It contains a detailed literature review and the author includes all proofs to make the presentation accessible. Ideas for future research and explorations are also provided. Students and researchers in computer science and mathematics will benefit from this work. Full Product DetailsAuthor: Apostolos SyropoulosPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: Softcover reprint of the original 1st ed. 2014 Volume: 31 Dimensions: Width: 15.50cm , Height: 1.00cm , Length: 23.50cm Weight: 2.759kg ISBN: 9781493943623ISBN 10: 1493943626 Pages: 162 Publication Date: 23 August 2016 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsIntroduction.- A Précis of Classical Computability Theory.- Elements of Fuzzy Set Theory.- On Fuzzy Turing Machines.- Other Fuzzy Models of Computation.- Appendix A: Computing with Words.- Appendix B: The Rough Sets Approach.- References.- Subject Index.- Name Index.ReviewsFrom the book reviews: “The book can be recommended to students and researchers in all areas dealing with computational complexity, especially for those in computer science and mathematics.” (Radko Mesiar, zbMATH, Vol. 1295, 2014) From the book reviews: The book can be recommended to students and researchers in all areas dealing with computational complexity, especially for those in computer science and mathematics. (Radko Mesiar, zbMATH, Vol. 1295, 2014) From the book reviews: The book can be recommended to students and researchers in all areas dealing with computational complexity, especially for those in computer science and mathematics. (Radko Mesiar, zbMATH, Vol. 1295, 2014) Author InformationTab Content 6Author Website:Countries AvailableAll regions |