Control algorithm

« Back to Glossary Index

A con­trol al­go­rithm is a math­e­mat­i­cal-log­i­cal ac­tion spec­i­fi­ca­tion for the work of a con­troller. Con­trol al­go­rithms are a log­i­cal se­quence of in­di­vid­ual, de­fined ex­e­cu­tion steps. A con­trol al­go­rithm can be in­te­grat­ed in­to the pro­gram of a com­put­er for con­crete ap­pli­ca­tion. To ex­e­cute a task, a spe­cif­ic in­put is then as­signed a spe­cif­ic out­put. A math­e­mat­i­cal de­f­i­n­i­tion of the term al­so reads: “A com­pu­ta­tion rule for the so­lu­tion of a prob­lem is called al­go­rithm, if an equiv­a­lent Tur­ing ma­chine ex­ists to this com­pu­ta­tion rule, which stops for each in­put, which has a so­lu­tion.” A Tur­ing ma­chine — in­tro­duced in 1936/36 by British math­e­mati­cian Alan Tur­ing — is a math­e­mat­i­cal mod­el in the­o­ret­i­cal com­put­er sci­ence that ab­stracts a ma­chine. In this mod­el, char­ac­ter-based ma­nip­u­la­tions are ex­e­cut­ed ac­cord­ing to fixed rules.

« Zurück zum Glossar Index