Enrol to start learning
Reading is open to everyone. Enrolling is free, and it is what unlocks the audio lessons, practice tests and progress tracking.
8. Uncomputable Functions
Computable and uncomputable functions are explored, emphasizing that certain functions cannot be computed regardless of available resources. The proof of existence of uncomputable functions involves comparing the cardinality of valid programs to functions. This culminates in a fundamental understanding that not all computational tasks can be resolved using algorithms.
Sections
This section discusses the concepts of computable and uncomputable functions, exploring the existence of uncomputable functions through a non-constructive proof.
There exist functions that cannot be computed by any program.
The set of all valid programs is countable, whereas the set of all functions from positive integers to a finite set is uncountable.
Uncomputable functions are fundamental in understanding the limitations of computation.
Computable Function
A function for which there exists a program that can compute its value for every input from its domain.
Uncomputable Function
A function for which no program can compute its value for every input, regardless of the resources available.
Cardinality
A measure of the 'size' of a set, particularly regarding the countability of sets.
Non-constructive Proof
A type of proof that demonstrates the existence of a case without constructing an example of it.
Practice Exercises
Total Questions
2
Estimated Time
4 min
Passing Score
70%
Instructions
- Read each question carefully
- You can use hints if you need help
- Complete all questions before submitting
1 more question available
Enrol free