Ordered instruction sequences {algorithm}| {recursive procedure} can perform functions in finite numbers of steps. Algorithms start from input data, process data, and make output data. Algorithms use finite numbers of symbols. Computing is algorithm automation and execution.
components
Algorithms use non-algorithmic components, such as containers, container adapters, function objects, and file manipulations. Containers are vectors and matrices. Container adapters are point graphs and edge graphs. Function objects are for sorting, generating random numbers, having properties, and comparing numbers.
input
Input requires redundancy to overcome noise.
output
Performing algorithm gives results {enaction}. Results are in code and have no intrinsic meaning. Result meaning relates to coded input.
processing
Algorithms can be recursive and nested and use feedback and feedforward. The shortest way to predict algorithm results is to run algorithm. The most compressed algorithm description is algorithm itself.
Mathematical Sciences>Computer Science>Software>Algorithm
3-Computer Science-Software-Algorithm
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224