The halting probability Omega: irreducible complexity in pure mathematics (Q931311): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:39, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The halting probability Omega: irreducible complexity in pure mathematics |
scientific article |
Statements
The halting probability Omega: irreducible complexity in pure mathematics (English)
0 references
25 June 2008
0 references
The author gives here a philosophically oriented and essentially non-technical, but not really covincing explanation of his understanding of mathematical incompleteness phenomena, centering around the (first) incompleteness theorem of Gödel, the unsolvability of the halting problem, and his approach toward algorithmic information theory culminating in the idea to compress the core information of the halting behavior in his halting probability \(\Omega\).
0 references
incompleteness theorems
0 references
philosophy of mathematics
0 references
algorithmic information theory
0 references
undecidability
0 references