Computability Theory - Graph View The branch of mathematical logic and computer science studying which problems can be solved algorithmically and which are fundamentally unsolvable. View concept details Related ConceptsHalting Problem Undecidability Turing Machine Church-Turing Thesis Gödel's Incompleteness Theorems Cantor's Diagonal Argument Recursion Computational Thinking ← Back to full graph