Understanding Computability Theory 📘

If you find our videos helpful you can support us by buying something from amazon.
https://www.amazon.com/?tag=wiki-audio-20

Computability theory

Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.The basic questions addressed by recursion theory are "What does it mean for a function on the natural numbers to be computable?" and "How can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".

-Video is targeted to blind users

Attribution:
Article text available under CC-BY-SA
image source in video


https://www.youtube.com/watch?v=SUtq4JXBbxM