Et and an infinitary church’s thesis
- 38 Downloads
KeywordsCellular Automaton Turing Machine Recursive Function Normal Algorithm Local Bubble
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- Gandy, R., The confluence of ideas in 1936, inThe Universal Turing Machine: A Half-Century Survey (R. Herken, ed.), Hamburg: Kammerer & Unverzagt (1988).Google Scholar
- Kreisel G., Church’s Thesis: a kind of reducibility axiom for constructive mathematics, inIntuitionism and Proof Theory: Proceedings of the Summer Conference at Buffalo, N.Y. (A. Kino, J. Myhill, R. E. Vesley, eds.), Amsterdam: North- Holland (1970).Google Scholar
- Lopez-Escobar, E. G. K., Infinite rules in finite systems, inNon- classical Logics, Model Theory and Computability (A. I. Arruda, da N. C. A. Costa, and R. Chuaqui, eds.), Amsterdam: North-Holland (1977).Google Scholar
© Springer-Verlag 1995