Note: The translation for this entry is currently under quality review. Some content is temporarily displayed in English only.
computable
This term is primarily used in the fields of computer science, mathematics, and logic to describe a function or problem that can be solved by a Turing machine. It carries a technical, precise connotation, distinguishing between problems that are theoretically solvable through a finite sequence of steps and those that are undecidable.
In a broader, non-technical sense, it describes any value or result that can be determined through calculation. It is distinct from "calculable," which often refers to the practical ability to compute something, whereas "computable" focuses on the theoretical possibility of an algorithmic solution.
Meanings
Capable of being calculated or solved by a mathematical process or a computer algorithm.
The problem is computable if there exists an algorithm that can solve it in a finite amount of time.