A Chaitin \(\Omega\) number based on compressible strings (Q1761717): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11047-011-9272-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11047-011-9272-Y / rank | |||
Normal rank | |||
Latest revision as of 09:09, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Chaitin \(\Omega\) number based on compressible strings |
scientific article |
Statements
A Chaitin \(\Omega\) number based on compressible strings (English)
0 references
15 November 2012
0 references
algorithmic information theory
0 references
algorithmic randomness
0 references
Chaitin \(\Omega\) number
0 references
compressible string
0 references
fixed point
0 references
partial randomness
0 references
program-size complexity
0 references
0 references
