Computable function

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

A computable function is an idea from computer science. A function is computable if there is an algorithm that can work out its result in a finite number of steps.

Computability theory is all about such functions.