Simplicity via provability for universal prefix-free Turing machines (Q616504): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57001536, #quickstatements; #temporary_batch_1711055989931 |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 0906.3235 / rank | |||
Normal rank |
Revision as of 16:15, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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