Click each word to view the definition.
A proof by contradiction is a two-step proof that something is false that is done by:
1) assuming that it's true
2) showing how that's impossible (that it creates a contradiction)
An undecidable statement might be true or might be false; we don't know which.
A self-contradictory statement can be neither true nor false.
Need to add If There is Time Slides
Need to add Take It Further Slides
Click each word to view the definition.
An infinite loop is a sequence of computer instructions that repeats forever.
An unsolvable problem is one for which no algorithm can ever be written to find the solution.
An undecidable problem is one for which no algorithm can ever be written that will always give a correct true/false decision for every input value. Undecidable problems are a subcategory of unsolvable problems that include only problems that should have a yes/no answer (such as: does my code have a bug?).