According to the Curry-Howard correspondence, there is an isomorphism between programs (algortihms) and proofs.
So the Gödel's incompleteness discoveries should be extendable to algortihms.