The phrase "amenable to computation" is correct and usable in written English.
It can be used in contexts where you want to indicate that something is suitable or capable of being computed or calculated.
Example: "The data set is amenable to computation, allowing for efficient analysis and interpretation."
Alternatives: "suitable for computation" or "capable of being computed".
In particular, we create a characterization of Nash equilibria termed differential Nash equilibria in games on non-convex strategy spaces that is amenable to computation.
For this purpose, fortunately, the cosmological evolution of model universes is especially simple and amenable to computation at redshifts much larger than 10,000 (or temperatures substantially above 30,000 K) because the physical properties of the dominant component, photons, then are completely known.
The Phenoscape project aims to represent these complex and detailed descriptions with rich and formal semantics that are amenable to computation and integration with phenotype data from other fields of biology.
Although statistical thermodynamics would in principle provide the necessary equations to calculate free energies of binding from molecular properties, these equations are not readily amenable to computation since appropriate ensembles of the solvated systems must be generated and thoroughly sampled, which normally requires prohibitively long computing times.
As site-independent evolutionary models are readily amenable to computation, we expect these results to be widely applicable in the context of the reconstruction of evolutionary histories.
In this framework, evaluation of both the electronic ground-state and forces on the nuclei are amenable to computations that scale linearly with the number of atoms.
These models are amenable to computational analysis.
More amenable to parallel computation, they are much faster than the nearest neighbor classifier (NN), which, however, has distinctly outperformed them in several applications.
We show that the continuous graph partitioning problem is convex and non-differentiable, and we characterize a solution amenable to distributed computation.
Furthermore, we show that for certain classes of systems, block-diagonalization of the system matrices can bring the regularized optimal control problems into forms amenable to efficient computation via distributed algorithms.
A case study of a hospital building with 28 facilities was employed to demonstrate that this model is rather efficient to solve the architectural layout problem, and it is amenable to fast computation for large layout problems.
