[G¨odel, 1990b] **K. G¨odel. G¨odel 1972a: Some remarks on the undecidability**
results. In S. Feferman et al., editors, **Collected Works: Publications 1938-** 1974**, volume 2. Oxford University Press, New York, 1990.**
[Hilbert and Ackermann, 1928] D. Hilbert and W. Ackermann. **Grundz¨uge**
der theoretischen Logik**. Springer, Berlin, 1928.**
[Hopcroft and Ullman, 1979] John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation**. AddisonWesley, Reading, Massachusetts, 1979.**
[Kleene, 1952] S. C. Kleene. Introduction to Metamathematics**. NorthHolland, Amsterdam, 1952.**
[Kleene, 1987] S. C. Kleene. Reflections on Church's thesis. **Notre Dame**
Journal of Formal Logic**, 28(4):490–498, 1987.**
[Lucas, 1961] J. R. Lucas. Minds, machines, and G¨odel. Philosophy**, 36:112–**
137, 1961.

[Piaget, 1970] **J. Piaget. Piaget's theory. In P. H. Mussen, editor,**
Carmichael's Manual of Child Psychology**. John Wiley, New York, 1970.**
[Post, 1944] **E. Post. Recursively enumerable sets of positive integers and**
their decision problems. **Bulletin of the American Mathematical Society**,
50(5):284–316, 1944.

[Shapiro, 1998] S. Shapiro. Incompleteness, mechanism, and optimism. The Bulletin of Symbolic Logic**, 4(3):273–302, 1998.**
[Sieg, 1994] **W. Sieg. Mechanical procedures and mathematical experience.**
In A. George, editor, Mathematics and Mind**. Oxford University Press,**
New York, 1994.

[Turing, 1936] **A. M. Turing. On computable numbers, with an application**
to the Entscheidungsproblem. In **Proceedings of the London Mathematical**
Society, volume 42 of series 2**, pages 230–265, 1936.**
[Turing, 1969] **A. M. Turing. Intelligent machinery. In B. Meltzer and**
D. Michie, editors, Machine Intelligence 5**. Edinburgh University Press,**
1969.