Computability Theory

Computability Theory is the study of what can be computed or solved by machines (like computers). It's like understanding the limits of what problems a computer can solve, how quickly it can solve them, and what problems are too complex. It's deeply intertwined with logic, as it examines the reasoning and rules that a machine follows to solve problems. Think of it as the 'rulebook' for computer problem-solving.