Outrageously Funny Word Dictionary :: Undecidable

👉 In computer science, a term that can be used to describe an algorithm or procedure is "undecidable." Undecidable means that it cannot be solved in a finite number of steps. This means that there is no known way to determine whether a problem is solvable or not using a finite amount of computational resources. For example, the halting problem is undecidable because it is impossible to decide if a program will halt on any input. Similarly, the Entscheidungsproblem is also

undecidable