DescriptionRecursive enumeration of all halting Turing machines.gif
English: Shows an algorithm to enumerate the set of all Turing machines halting on a fixed input x: Simulate all Turing machines (enumerated in green on vertical axis) step by step (horizontal axis), using the shown diagonalization scheduling (red line). If a machine terminates, print its number. This way, the number of each terminating machine is eventually printed. In the example, the algorithm prints 9, 13, 4, 15, 12, 18, 6, 2, 8, 0, ...
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.