Computability - Graph View The study of which problems can in principle be solved by an algorithm or effective procedure, and which cannot, regardless of available time or memory. View concept details Related ConceptsComputability Theory Halting Problem Church-Turing Thesis Turing Machine Decidability Automata Theory ← Back to full graph