In recent years, mathematicians have made significant progress in expanding the realm of mathematical unknowability. This has been achieved by proving a broader version of Hilbert's famous 10th problem, which has far-reaching implications for various fields of study. The expansion of mathematical unknowability has significant consequences for computation and algorithms. As we push the boundaries of what is thought to be computationally feasible, we risk rendering certain cryptographic systems vulnerable to attack. This highlights the need for a comprehensive re-evaluation of current security protocols and the development of more resilient alternatives. While the breakthroughs in this field may seem esoteric, they have significant potential applications in fields such as coding theory and error-correcting codes. As researchers continue to explore the limits of mathematical knowledge, they may uncover new insights that could lead to innovative solutions in these areas.