Challenge: can you take the sqrt (n) using only one operation

[Antiphon]

It can be done in one step provided you specify the precision in advance.

You use the number as the index into an array containing the root. As long as the precision is specified, each real number is represented by an integer. Most modern computers will perform the indexed register load as an atomic operation (single step).

 

[logics]

Did you mean "viewers"?

I'm of courteous disposition and act my age, do you expect a reply?

I suggested: (edited OP)

The best known algorithm EDIT: i.e. iterative method ('Babylonian') to take the square root of a number requires 3 operations...
Do you know a simpler or faster one?
Can you find a method that requires only 1 operation? (N_o = 1)

EDIT : a [square]root is found with N_t ops., iterating N_i times a formula that requires N_o ops. using N₊ different op-signs. N_t = N_i * N_o.
Babylonian method, $\sqrt{354.045^2}, ($ if x₀ = 300.00) : N₊=N_o = 3, N_i = 4 , 3 * 4 $\rightarrow$ N_t = 12 operations
if N_o = 1 $\rightarrow$ (N₊ = 1, N_t = N_i); [in the title: N₊ = 1 $\rightarrow$ N_o = 1 , N_t < 12] ;
N_t < 8 is a 'good' solution, (5 * 1) = 5 operations would be 'brilliant'.

Post #31 proves that new readers can't carefully examine all previous posts. An edit to the OP would probably help. Thanks.