Decidability (Undecidable or Decidable problem)

1 - 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

3 - Example

3.1 - 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.

Data Science
Data Analysis
Data Science
Linear Algebra Mathematics

Powered by ComboStrap