Simplicity via provability for universal prefix-free Turing machines (Q616504)
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
| 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 |
Statements
Simplicity via provability for universal prefix-free Turing machines (English)
0 references
10 January 2011
0 references
universal Turing machine
0 references
provability
0 references
simplicity
0 references
0.9770344495773317
0 references
0.7286518216133118
0 references
0.7187347412109375
0 references
0.7134378552436829
0 references
0.7119600772857666
0 references
