Turing Completeness in computations.

Gödel’s Incompleteness Theorem is BS.

In Alan Turing’s papers if we read between the lines, then, he proposes Turing Completeness.

This represents a master algorithm to print or produce all other algorithms. That is the content of a true Turing Machine.

Turing Completeness is a counter example to Gödel’s Incompleteness Theorem. This is trivial to reproduce in the language of either Gödel’s or Turing’s mathematics.

Turing Completeness represents better encryption and decryption, smaller compression and decompression and safer, more secure networks of telecommunications.

Try it out.