Sentence examples for this computation was from inspiring English sources

Napier discovered that the basis for this computation was a relationship between an arithmetical progression a sequence of numbers in which each number is obtained, following a geometric progression, from the one immediately preceding it by multiplying by a constant factor, which may be greater than unity (e.g., the sequence 2, 4, 8, 16... ) or less than unity (e.g., 8, 4, 2, 1, 1/2... )...

The time required for this computation was 8 hours and 43 minutes.

The result of this computation was three factor variables representing AAL at different times: AAL peak (eigenvalue = 3.29), AAL nonpeak day (eigenvalue = 3.36), and AAL nonpeak night (eigenvalue = 3.21).

The run time required for this computation was 23 hours and 18 minutes, of which 1 hour 7 minutes was used to convert the final result from binary to decimal.

This computation was performed by minimizing an objective function consisting of the sum of the squares over N measurements of the differences between the experimental data f release and the model-predicted output f release.

Following Endamana et al. (2016), this computation was mathematically presented as follows: mathrm{T}mathrm{H}mathrm{I}=mathrm{O}mathrm{F}mathrm{I}+mathrm{AI}+mathrm{F}mathrm{I} (2).

It is easy to show, however, even with the high computing speed available in electronic calculators this computation is impractical.

However, the expected value of the state must be computed from all combinations of the Boolean functions, and this computation is hard for large-scale systems.

This computation is showed next, via a mutually recursive formulation that also computes values in the sets α, α, and α.

This computation is shown in Fig. 8. Second, Q1 and Q3 are computed.

That this computation is less visible than it was in Reed's day, when an observer could follow the progress of a calculation in blinking lights across the room, doesn't make it less pervasive.