jms137
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| Goldbach's conjecture tested by a 47-state Turing machine | |
| Author: Jared Showalter | |
| If "a" and "i" were unbounded, this program would halt iff Goldbach's | |
| conjecture is false. Furthermore, the program structurally | |
| corresponds to a Turing machine with two symbols, one tape, and a | |
| small number of states. The array "a" corresponds to the tape (each |