|
so:text
|
The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite means. ...According to my definition, a number is computable if its decimal can be written down by a machine. ...I show that certain large classes of numbers are computable. They include, for instance, the real parts of alls, the real parts of the zeros of the Bessel functions, the numbers π, e, etc. The computable numbers do not, however, include all definable numbers. ...onclusions are reached which are superficially similar to those of Gödel. ...t is shown ...that the Hilbertian can have no solution. In a recent paper... reaches similar conclusions... (en) |
