This analysis is being reviewed by experts and was proposed by:

The Mathematician: Rodolfo Nieves Rivas.

Please give credit to the author, Rodolfo Nieves Rivas.

And also exactly computable, not approximate.
Based on linear and discrete programming.
And these exact construction methods are developed with recognized geometric foundations.
That allow us to avoid the halting problem of the universal Turing machine.

And all its digits cannot be calculated with exact precision.
Consequently, a contradiction arises.
Nieves proposes:
The design and development of a geometric computer, or one with a completely geometric architecture or topology, for constructible numbers.

Computable Numbers Versus Numbers Constructible with a Ruler, Without Marks, and Compass.
Example:
The Golden Ratio is constructible but not computable.
Since the square root of 5
is not exactly computable with its complete decimal representation.