This is the question of
computability: a
computability problem is computable if it can be solved by some algorithm; a problem that is noncomputable cannot be solved by any algorithm.
[
enCOMPUTABILITY12 ]
Note that the effective
computability of these functions does not imply that they can be efficiently computed (i.e. computed within a reasonable amount of time).
[
enCOMPUTABLE_FUNCTION ]
To develop such an approach one must in general leave the realm of plain numerical simulation and look for general statements
on
computability (in the sense of the theory of computation) of the objects and concepts of dynamical systems theory.
[
enDYNAMICAL_SYSTEMS ]
French
caractère calculable
MCLH CG AMG
05/07/2015
|