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.
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.
The halting problem is not computable.
by alpsmac February 23, 2010
by SquirrelMoose August 15, 2008
by RedHawkTech April 29, 2009
by Mystery Man January 28, 2003
by LizzanceRopierre February 21, 2005
A machine consisting of a processing unit, some form of memory, and peripheral devices for input and output. Used almost exclusively for updating Adobe Flash, updating Adobe PDF Reader, updating Java, and updating iTunes.
I have a lot of work to do on the computer today, my Adobe PDF Reader hasn't been updated since last night and my Java is nearly three days old!
by flamberge April 30, 2013
by Why do I keep coming here? September 24, 2003