A number is computable if it can be determined to any required accuracy by an algorithm. Rational numbers are computable, but so is any number expressible as the sum of an infinite series, such as pi. As there are denumerable algorithms (or programs) that are of finite length in a finite alphabet, there are denumerably many computable numbers. As the real numbers are uncountable, this means almost all real numbers are not computable.