1. S. Aaronson, Why philosophers should care about computational complexity, in Computability: Turing, Gödel, Church, and Beyond, pp. 261–327 (MIT Press, 2013)
2. S. Arora, B. Barak, Computational Complexity: A Modern Approach (Cambridge University Press, 2009)
3. J.D. Barrow, Theories of Everything: The Quest for Ultimate Explanation (Clarendon Press, Oxford, 1991)
4. J.D. Barrow, Godel and physics. Kurt Gödel and the Foundations of Mathematics: Horizons of Truth, p. 255 (2011)
5. J.L. Carroll, A Bayesian decision theoretical approach to supervised learning, selective sampling, and empirical function optimization (2010)