is complete. Hilbert’s Completeness Theorem — Geometry is complete. Turing’s Machines Entscheidungsproblem — The decision problem has no solution. Turing Thesis — All computers, once sufficiently powerful, are equally powerful. Non-Computability of Musict - That general musical compositions are non-computabl