Some Gödel centenary reflections on whether incompleteness is really serious, and whether mathematics should be done somewhat differently, based on using algorithmic complexity measured in bits of information. © 2007 Birkhaueser.
CITATION STYLE
Chaitin, G. (2007). The halting probability omega: Irreducible complexity in pure mathematics. Milan Journal of Mathematics, 75(1), 291–304. https://doi.org/10.1007/s00032-006-0064-2
Mendeley helps you to discover research relevant for your work.