| __Computing Papers on Theorem__ *(Site not responding. Last check: )* |

| | Some of the principal **Theorems** include the existence of a universal program, the unsolvability of the halting problem (there does not exist a mechanical means of checking for infinite loops in the executions of programs), and Rice`s **Theorem**. |

| | The sweeping conclusion of Rice`s **Theorem** is the impossibility of algorithmically analyzing computer programs to determine in which cases a given property is possessed by the function computed by the program. |

| | Unfortunately, after GÂ¨del announced his famed incompleteness **Theorem** in o 1931 stating that it is impossible to have a formalism that can help us to reach all truths and only truths, we nally realized that we had gone a long way in ghting a battle that was impossible to win. |

| computing.breinestorm.net /Theorem (3065 words) |