Chaitin Ω Numbers and Halting Problems (Q3576077): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Recursively enumerable reals and Chaitin \(\Omega\) numbers / 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: Algorithmic Information Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4436369 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Randomness and Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomness and Recursive Enumerability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On initial segment complexity and degrees of randomness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computability and Randomness / rank | |||
Normal rank |
Latest revision as of 01:59, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Chaitin Ω Numbers and Halting Problems |
scientific article |
Statements
Chaitin Ω Numbers and Halting Problems (English)
0 references
28 July 2010
0 references
algorithmic information theory
0 references
Chaitin \(\Omega \) number
0 references
halting problem
0 references
Turing reduction
0 references
algorithmic randomness
0 references
program-size complexity
0 references