Fasciculus:Recursive enumeration of all halting Turing machines.gif
Jump to navigation
Jump to search
Nulla maior resolutio exstat.
Recursive_enumeration_of_all_halting_Turing_machines.gif (683 × 371 elementa imaginalia, magnitudo fasciculi: 16 chiliocteti, typus MIME: image/gif)
Summarium
| Descriptio |
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, ... |
| Datum | |
| Fons | Opus proprium |
| Auctor | Jochen Burghardt |
Potestas usoris
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- Tibi licet:
- communicare – copiare, distribuere et committere hoc opus
- to remix – to adapt the work
- His condicionibus:
- attributio – 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.
- aequa parte – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Historia fasciculi
Presso die vel tempore fasciculum videbis, sicut tunc temporis apparuit.
| Dies/Tempus | Minutio | Dimensiones | Usor | Sententia | |
|---|---|---|---|---|---|
| recentissima | 18:43, 30 Novembris 2013 | | 683 × 371 (16 chiliocteti) | wikimediacommons>Jochen Burghardt | User created page with UploadWizard |
Nexus ad fasciculum
Ad hunc fasciculum nectit:
