Simplicity via provability for universal prefix-free Turing machines (Q5145146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simplicity via provability for universal prefix-free Turing machines |
scientific article; zbMATH DE number 7298580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplicity via provability for universal prefix-free Turing machines |
scientific article; zbMATH DE number 7298580 |
Statements
20 January 2021
0 references
0.9770344495773317
0 references
0.7540518641471863
0 references
0.7402598261833191
0 references
0.7335310578346252
0 references
0.7283786535263062
0 references
