Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
Define a computable function in your own words.
Think about the relationship between functions and programs.
What is an example of an uncomputable function?
Consider problems that seem not to have a clear solution.
What defines a computable function?
Think about the role of programs in defining functions.
The Halting Problem is an example of which type of function?
Recall the definition of uncomputable functions.
Prove the existence of an uncomputable function using cardinality arguments.
Revisit the definitions of countable and uncountable sets and apply them to the sets of functions and programs.
Construct a hypothetical example of an uncomputable function and explain why it cannot be computed.
Think about the implications surrounding determining halting conditions for all programs.
5 more questions in this section. Enroll free to practise them all.
Enroll free