. . . . . . . . . . . . . . . . . . . . . "20220"^^ . . . "In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers, effective numbers or the computable reals or recursive reals. Equivalent definitions can be given using \u03BC-recursive functions, Turing machines, or \u03BB-calculus as the formal representation of algorithms. The computable numbers form a real closed field and can be used in the place of real numbers for many, but not all, mathematical purposes."@en . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "In mathematics, computable numbers are the real numbers that can be computed to within any desired precision by a finite, terminating algorithm. They are also known as the recursive numbers, effective numbers or the computable reals or recursive reals. Equivalent definitions can be given using \u03BC-recursive functions, Turing machines, or \u03BB-calculus as the formal representation of algorithms. The computable numbers form a real closed field and can be used in the place of real numbers for many, but not all, mathematical purposes."@en . . . . . . . . "1072601550"^^ . . . . . . "6206"^^ . . . . "Computable number"@en . . . . . . . . . . . . . . . . . . . . . .