> [!Definition] > > > [!info] > You can implement this algorithm by writing a [[Computer program|computer program]]. # Properties An algorithm solves a [[Computational Problem|computational problem]] if for any input it outputs a valid solution. By [[Church-Turing Thesis|Church-Turing thesis]], every algorithm is equivalent some [[Turing Machine|Turing machine]]. **Time & space complexity:** [[Time complexity of an algorithm]] ([[Worst-case Running Time of Algorithm]]); [[Space complexity of an algorithm]].