computability theory

Investigation into whether a mathematical problem is solvable or not, and what amount of number crunching is required to solve it. Based on the works of UK mathematician Alan Turing (1912-1954) and US logician Alonzo Church (1903-1995), it states that so far as a procedure is unambiguous there is an algorithmic way of executing it.