Decidability (Undecidable or Decidable problem)

About

Decidability is the question of what can or cannot be done by a computer.

  • Problems that cannot be solved by computation are called undecidable
  • Problems that can be solved by computer are called decidable

Example

undecidable

There is no way to tell whether a program will ever print a particular word, or even whether it will ever print anything at all.


Powered by ComboStrap