(Untitled) | (Untitled) | (Untitled) | (Untitled) | (Untitled) | Examples |

IEVref: | 351-42-27 | ID: | |

Language: | en | Status: Standard | |

Term: | algorithm | ||

Synonym1: | |||

Synonym2: | |||

Synonym3: | |||

Symbol: | |||

Definition: | completely determined finite sequence of instructions by which the values of the output variables may be calculated from the values of the input variables Note 1 to entry: The behaviour of a system with discrete-value input and output variables (for example a switching system) may be described completely by an algorithm. For a system with continuous-value and continuous-time input and output variables the algorithm is given by or derived from the mathematical relationship between the input and output variables. Note 2 to entry: This entry was numbered 351-21-37 in IEC 60050-351:2006. | ||

Publication date: | 2013-11 | ||

Source: | |||

Replaces: | |||

Internal notes: | |||

CO remarks: | |||

TC/SC remarks: | |||

VT remarks: | |||

Domain1: | |||

Domain2: | |||

Domain3: | |||

Domain4: | |||

Domain5: |

Note 1 to entry: The behaviour of a system with discrete-value input and output variables (for example a switching system) may be described completely by an algorithm. For a system with continuous-value and continuous-time input and output variables the algorithm is given by or derived from the mathematical relationship between the input and output variables.

Note 2 to entry: This entry was numbered 351-21-37 in IEC 60050-351:2006.