Simplicity via provability for universal prefix-free Turing machines (Q616504): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963427251 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57001536 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0906.3235 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4806962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5188206 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3584055 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5188221 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every computably enumerable random real is provably computably enumerable random / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4381402 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representation of left-computable \(\varepsilon \)-random reals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal Recursively Enumerable Sets of Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On universal computably enumerable prefix codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5321501 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Randomness and Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5302560 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001935 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomness and Recursive Enumerability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5393491 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5586325 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Four Small Universal Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small Semi-weakly Universal Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Small Universal Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3611832 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3150942 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:48, 3 July 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