Course contentsShow
Computer Science
Lesson 1875 of 2,87242. Turing Machines and ComputabilityPro lesson

Recognizable vs. Decidable

Clarify that recognizable languages may loop forever, while decidable languages always halt.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.