Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What defines a computable function?
Think about programs that always give outputs.
Give an example of an uncomputable function.
Consider a function that determines program behavior.
What is a computable function?
Remember the definition of computability.
True or False: The Halting Problem is an example of a computable function.
Consider if there is a way to determine program halting.
Argue whether all mathematical questions can be computed through algorithms, providing examples of uncomputable functions.
Think of functions with indefinite outcomes.
Create a visual representation or diagram showing the relationship between countable and uncountable sets, and how it applies to functions and programs.
Focus on illustrating elements and their sets.
5 more questions in this section. Enroll free to practise them all.
Enroll free