tag:blogger.com,1999:blog-3722233.post85448416..comments2024-03-27T19:58:17.387-05:00Comments on Computational Complexity: Foundations of ComplexityLesson 2: Computable and Computably Enumerable LanguagesLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3722233.post-77576331545204107432009-11-13T06:49:44.677-06:002009-11-13T06:49:44.677-06:00recognizable languages can be accepted by some tur...recognizable languages can be accepted by some turing machine, but if an input string is not a member of the language, they will either reject or loop forever, never halting. Decidable languages are a subset of the recognizable languages, the difference being that not only can they be accepted by some turing machine, if an input string is not a member of the language then it will definitely reject. Decidable languages never loop forever.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3722233.post-22852086160159603532009-09-17T12:12:12.839-05:002009-09-17T12:12:12.839-05:00Can you please elaborate the difference between re...Can you please elaborate the difference between recognizable and decidable languages.Abhishek Goyalnoreply@blogger.com