Our research problem begins with Gödel’s Incompleteness Theorem that states:

“In any reasonable mathematical system there will always be true statements that cannot be proved”

The halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.

The halting problem is the first proven example of an undecidable problem.

“Building Quantum Resistant Encryption”

The above question is the problem statement at the core of our recent research.

By researching the progress of the problem, theorems developed earlier and the concept of undecidability we have developed our own patented encryption as a proposed method to solve the problem.

Latest News