File:Recursive enumeration of all halting Turing machines.gif
From Vigyanwiki
No higher resolution available.
Recursive_enumeration_of_all_halting_Turing_machines.gif (683 × 371 pixels, file size: 16 KB, MIME type: image/gif)
Summary
| Description |
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, ... |
| Date | |
| Source | Own work |
| Author | Jochen Burghardt |
Licensing
I, the copyright holder of this work, hereby publish it under the following licence:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported licence.
- You are free:
- 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 licence, 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 licence as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 23:13, 30 November 2013 | | 683 × 371 (16 KB) | wikimediacommons>Jochen Burghardt | User created page with UploadWizard |
File usage
The following page uses this file:
