Decomposition and Abstraction through Functions
Lecture Title: Decomposition and Abstraction Through Functions
Professor Eric Grimson dives into Recursion theory, also called computability theory, studies the properties of computable functions and the Turing degrees, which divide the uncomputable functions into sets that have the same level of uncomputability.
He explains how Recursion theory also includes the study of generalized computability and definability. Recursion theory grew from the work of Alonzo Church and Alan Turing in the 1930s, which was greatly extended by Kleene and Post in the 1940s.
Your Feedback Welcomed:
If you found this lecture useful please make sure to click the heart button to the left of the video player, comment, share with your social media venues, or ALL of the above!