The proof of the first incompleteness theorem is a very technical way of constructing the statement: "The truth of this statement is unproveable".

In the software form, it can be restated as: "there is no finite program that outputs the sequence with this property".