The Church-Turing "Thesis" as a Special Corollary of Gödel’s Completeness Theorem
Saul A. Kripke · Computability · 2013
This chapter contains sections titled: 4.1 The Previously Received View and More Recent Challenges, 4.2 Computation as a Special Form of Mathematical Argument, 4.3 Von Neumann's Problem of Characterizing and Proving Unsolvability and Godel's Theorem IX, 4.4 Some Clarificatory Remarks on the Present Characterization, 4.5 Conclusion, Notes, References