computability theory

Definition

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.


computability theory is...

Nearby Terms

Search volume for computability theory

Browse by Letter: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z