The following pages link to Algorithmic information theory (Q3197800):
Displaying 12 items.
- Models and the dynamics of theory-building in physics. I: Modeling strategies (Q643103) (← links)
- On interpreting Chaitin's incompleteness theorem (Q1277329) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- Revisiting Chaitin's incompleteness theorem (Q1982000) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Is complexity a source of incompleteness? (Q2386137) (← links)
- On explicating the concept `the power of an arithmetical theory' (Q2481252) (← links)
- Kolmogorov complexity and characteristic constants of formal theories of arithmetic (Q3096081) (← links)
- On Characteristic Constants of Theories Defined by Kolmogorov Complexity (Q3511460) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness (Q5250214) (← links)
- Observation of Unbounded Novelty in Evolutionary Algorithms is Unknowable (Q5881516) (← links)