Reading list

Barmpalias, G. 2018. Aspects of Chaitin’s Omega. Working paper.

Church, A. (1936). An Unsolvable Problem of Elementary Number Theory. Journal of Mathematics 58 (2). pp. 345–363.

Copeland, BJ., Posy, CJ., Shagrir, O. (2013). Computability. Turing, Gödel, Church, and Beyond. MIT.

Gödel, K. (1931a). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik 38: 173–98.

Hilbert, D. (1899). Foundations of Geometry.

Hilbert, D. and Ackermann, W. (1928). Grundzuge der theoretischen Logik.

Lloyd, 2001. Computational Capacity of the Universe.

Penrose, 2016. Uncomputational Functions. Handout #15. October 24, 2016

Sieg, U. (1994). Aufstieg und Niedergang des Marburger Neukantianismus: die Geschichte einer philosophischen Schulgemeinschaft.

Soare, RI, (2013). Interactive Computing and Relativized Computability in Computability. Turing, Gödel, Church and Beyond. MIT. pp. 203.

Turing, A. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42.

Wang, H. (1961). Proving theorems by pattern recognition — II, Bell System Technical Journal, 40 (1) pp. 1–41,

Whitehead A. & Russell, B. (1910). Principia Mathematica, vol. I

Whitehead A. & Russell, B. (1912). Principia Mathematica, vol. II

Whitehead A. & Russell, B. (1913). Principia Mathematica, vol. III