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.
Enroll to start learning
You've not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- 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.
Key Concepts
- -- 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.
- -- Nonconstructive Proof
- A type of proof that demonstrates the existence of a case without constructing an example of it.
Additional Learning Materials
Supplementary resources to enhance your learning experience.