Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
A Comparison Of Cryptographic Methods, Christopher Gilmore
A Comparison Of Cryptographic Methods, Christopher Gilmore
Senior Honors Theses
While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …
Gödel's Incompleteness Theorems, Derick Swarey
Gödel's Incompleteness Theorems, Derick Swarey
Senior Honors Theses
The Incompleteness Theorems of Kurt Godel are very famous both within and outside of mathematics. They focus on independence and consistency within mathematics and hence a more thorough understanding of these is beneficial to their study. The proofs of the theorems involve many ideas which may be unfamiliar to many, including those of formal systems, Godel numbering, and recursive functions and relations. The arguments themselves mirror the Liar’s Paradox in that Godel constructs a statement asserting its own unprovability and then shows that such a statement and its negation must both be independent of the system, otherwise the system is …
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
Senior Honors Theses
One of the most investigated topics in operations research is the Traveling Salesman Problem (TSP) and the algorithms that can be used to solve it. Despite its relatively simple formulation, its computational difficulty keeps it and potential solution methods at the forefront of current research. This paper defines and analyzes numerous proposed solutions to the TSP in order to facilitate understanding of the problem. Additionally, the efficiencies of different heuristics are studied and compared to the aforementioned algorithms’ accuracy, as a quick algorithm is often formulated at the expense of an exact solution.