Search the courses, subjects, tracks, games and features, or jump straight to a page.
4 cards from this section. Quick, good the night before a test.
Define a computable function.
Think about whether a program can calculate the output for every input.
What is an uncomputable function?
Consider what might prevent a program from being able to find an answer.
What defines a computable function?
Focus on what it means to have a program for every input.
True or False: Uncomputable functions can be calculated with limitless resources.
Think about the limits of computational power.
Select an uncomputable function and explain why it cannot be computed. Use references to countability.
Focus on the interactions of infinite sets and the limits of computation.
Devise a non-constructive proof that establishes the existence of an uncomputable function using Cantor's diagonalization.
Utilize Cantor’s argument to clarify the discrepancy in function and program count.
5 more questions in this section. Enroll free to practise them all.
Enroll free