computable

Imagine you're building with LEGO bricks. Some designs are simple—easy to build by following clear instructions (an algorithm). Those designs are "computable": a computer could follow the steps and, after a while, finish with an answer. Other designs might seem to demand endless steps, so no set of instructions can guarantee a final answer.

"Computable" doesn't just apply to LEGO bricks! It describes anything that can be solved using a defined process—from mathematical problems to logical puzzles. In the world of computer science, if something isn't computable, it means there is no algorithm that can reliably find an answer for every case. Think of it as a challenge for computers: can they compute this?

The word "computable" describes something that can be solved or determined by computation—meaning through the use of algorithms and calculations. It's a concept central to computer science, mathematics, and logic. While we often associate "computation" with computers, it fundamentally refers to any systematic process for solving a problem.

Originally, "computable" referred specifically to mathematical problems that could be solved using finite steps. However, the meaning has broadened. Now, it can apply to any task or question that can be expressed as an algorithm—a set of instructions a computer (or even a person!) could follow to arrive at a solution.

For example, calculating the area of a circle is computable because there's a formula you can use. Determining if a number is prime is also computable. However, some problems are not computable. The famous "Halting Problem" in computer science asks whether it's possible to write an algorithm that can determine, for any program and input, whether the program will eventually stop running or run forever—and the answer is no; there is no such algorithm that works in all cases.

In everyday language, you might say something like, "The cost of this project is computable based on these estimates," meaning you can calculate a reasonable price. Or, "Whether or not she'll accept the job offer is not easily computable," suggesting her decision depends on many unpredictable factors.

So, if something has a clear path to a solution through defined steps, it's likely "computable." If it remains stubbornly unsolvable, even in theory, then it falls outside the realm of computation.