Top Definition
The property of a problem being solved by means of a Turing machine.

In other words, can we write a program to solve the problem? If so, then the problem is computable.
The sorting problem is computable. I can sort lists of things based on a common comparator.

The halting problem is not computable.
by alpsmac February 23, 2010

Free Daily Email

Type your email address below to get our free Urban Word of the Day every morning!

Emails are sent from We'll never spam you.