An unsolvable problem that involves finding the longest running Turing Machines.
Problem Description
- Create a set of all Turing Machines that read from a Punchcard with rules.
- The Turing Machine that runs the longest before Halting (and without running in a loop), is denoted as , with as its number of steps
Current s
| BB | Number |
|---|---|
| BB(1) | 1 |
| BB(2) | 6 |
| BB(3) | 21 |
| BB(4) | 107 |
| BB(5) | 47176870 |