B. Jack Copeland
Skip Abstract Section
Abstract
In its original form, the Church-Turing thesis concerned computation as Alan Turing and Alonzo Church used the term in 1936---human computation.
- Aharonov, D. and Vazirani, U.V. Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics. Chapter in Computability: Gödel, Turing, Church and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013.Google Scholar
- Andréka, H., Németi, I., and Németi, P. General relativistic hypercomputing and foundation of mathematics. Natural Computing 8, 3 (Sept. 2009), 499--516. Google ScholarDigital Library
- Bernstein, E. and Vazirani, U. Quantum complexity theory. SIAM Journal on Computing 26, 5 (Oct. 1997), 1411--1473. Google ScholarDigital Library
- Castelvecchi, D. Paradox at the heart of mathematics makes physics problem unanswerable. Nature 528 (Dec. 9, 2015), 207.Google ScholarCross Ref
- Church, A. An unsolvable problem of elementary number theory. American Journal of Mathematics 58, 2 (Apr. 1936), 345--363.Google ScholarCross Ref
- Copeland, B.J. The broad conception of computation. American Behavioral Scientist 40, 6 (May 1997), 690--716.Google ScholarCross Ref
- Copeland, B.J. Even Turing machines can compute uncomputable functions. Chapter in Unconventional Models of Computation, C. Calude, J. Casti, and M. Dinneen, Eds. Springer, Singapore, 1998.Google Scholar
- Copeland, B.J. Narrow versus wide mechanism: Including a re-examination of Turing's views on the mind-machine issue. The Journal of Philosophy 97, 1 (Jan. 2000), 5--32.Google Scholar
- Copeland, B.J. Hypercomputation. Minds and Machines 12, 4 (Nov. 2002), 461--502. Google ScholarDigital Library
- Copeland, B.J. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life, Plus the Secrets of Enigma. Oxford University Press, Oxford, U.K., 2004.Google Scholar
- Copeland, B.J. and Proudfoot, D. Alan Turing's forgotten ideas in computer science. Scientific American 280, 4 (Apr. 1999), 98--103.Google ScholarCross Ref
- Copeland, B.J. and Shagrir, O. Do accelerating Turing machines compute the uncomputable? Minds and Machines 21, 2 (May 2011), 221--239. Google ScholarDigital Library
- Copeland, B.J. and Shagrir, 0. Turing versus Gödel on computability and the mind. Chapter in Computability: Gödel, Turing, Church, and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013.Google Scholar
- Cubitt, T.S., Perez-Garcia, D., and Wolf, M.M. Undecidability of the spectral gap. Nature 528, 7581 (Dec. 2015), 207--211.Google ScholarCross Ref
- Davis, M. Why Gödel didn't have Church's thesis. Information and Control 54, 1--2 (July 1982), 3--24.Google ScholarCross Ref
- Dershowitz, N. and Gurevich, Y. A natural axiomatization of computability and proof of Church's thesis. Bulletin of Symbolic Logic 14, 3 (Sept. 2008), 299--350.Google ScholarCross Ref
- Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 400, 1818 (July 1985), 97--117.Google Scholar
- Doyle, J. What is Church's thesis? An outline. Minds and Machines 12, 4 (Nov. 2002), 519--520. Google ScholarDigital Library
- Eisert, J., Müller, M.P., and Gogolin, C. Quantum measurement occurrence is undecidable. Physical Review Letters 108, 26 (June 2012), 1--5.Google ScholarCross Ref
- Gandy, R.O. Church's thesis and principles for mechanisms. In Proceedings of the Kleene Symposium, J. Barwise, H.J. Keisler, and K. Kunen, Eds. (Madison, WI, June 1978). North-Holland, Amsterdam, Netherlands, 1980.Google Scholar
- Goldreich, O. Computational Complexity: A Conceptual Perspective. Cambridge University Press, New York, 2008. Google ScholarDigital Library
- Gurevich, Y. What is an algorithm? In Proceedings of the 38<sup>th</sup> Conference on Current Trends in the Theory and Practice of Computer Science (Špindleůrv Mlýn, Czech Republic, Jan. 21--27), M. Bieliková, G. Friedrich, G. Gottlob, S. Katzenbeisser, and G. Turán, Eds. Springer, Berlin, Heidelberg, Germany, 2012. Google ScholarDigital Library
- Harel, D. Algorithmics: The Spirit of Computing, Second Edition. Addison-Wesley, Reading, MA, 1992. Google ScholarDigital Library
- Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979. Google ScholarDigital Library
- Kleene, S.C. Introduction to Metamathematics. Van Nostrand, New York, 1952.Google Scholar
- Komar, A. Undecidability of macroscopically distinguishable states in quantum field theory. Physical Review 133, 2B (Jan. 1964), 542--544.Google ScholarCross Ref
- Kreisel, G. Mathematical logic: What has it done for the philosophy of mathematics? Chapter in Bertrand Russell: Philosopher of the Century, R. Schoenman, Ed. Allen and Unwin, London, U.K., 1967.Google Scholar
- Kripke, S.A. Another approach: The Church-Turing 'thesis' as a special corollary of Gödel's completeness theorem. Chapter in Computability: Gödel, Turing, Church, and Beyond, B.J. Copeland, C.J. Posy, and O. Shagrir, Eds. MIT Press, Cambridge, MA, 2013.Google Scholar
- Lewis, H.R. and Papadimitriou, C.H. Elements of the Theory of Computation. Prentice Hall, Upper Saddle River, NJ, 1981. Google ScholarDigital Library
- Moschovakis, Y.N. and Paschalis, V. Elementary algorithms and their implementations. Chapter in New Computational Paradigms: Changing Conceptions of What Is Computable, S.B. Cooper, B. Lowe, and A. Sorbi, Eds. Springer, New York, 2008.Google Scholar
- Piccinini, G. The physical Church-Turing thesis: Modest or bold? The British Journal for the Philosophy of Science 62, 4 (Aug. 2011), 733--769.Google ScholarCross Ref
- Pitowsky, I. The physical Church thesis and physical computational complexity. Iyyun 39, 1 (Jan. 1990), 81--99.Google Scholar
- Post, E.L. Finite combinatory processes: Formulation I. The Journal of Symbolic Logic 1, 3 (Sept. 1936), 103--105.Google Scholar
- Pour-El, M.B. and Richards, I.J. The wave equation with computable initial data such that its unique solution is not computable. Advances in Mathematics 39, 3 (Mar. 1981), 215--239.Google ScholarCross Ref
- Sieg, W. Mechanical procedures and mathematical experience. Chapter in Mathematics and Mind, A. George, Ed. Oxford University Press, New York, 1994.Google Scholar
- Turing, A.M. On computable numbers, with an application to the Entscheidungsproblem (1936); in Copeland.<sup><zref=R10>10<zrefx></sup>Google Scholar
- Turing, A.M. Lecture on the Automatic Computing Engine (1947); in Copeland.<sup><zref=R10>10<zrefx></sup>Google Scholar
- Turing, A.M. Intelligent Machinery (1948); in Copeland.<sup><zref=R10>10<zrefx></sup>Google Scholar
- Wolfram, S. Undecidability and intractability in theoretical physics. Physical Review Letters 54, 8 (Feb. 1985), 735--738.Google ScholarCross Ref
- Yao, A.C.C. Classical physics and the Church-Turing thesis. Journal of the ACM 50, 1 (Jan. 2003), 100--105. Google ScholarDigital Library
Index Terms
- The Church-Turing thesis: logical limit or breachable barrier?
Recommendations
The church-turing thesis: breaking the myth
CiE'05: Proceedings of the First international conference on Computability in Europe: new Computational ParadigmsAccording to the interactive view of computation, communication happens during the computation, not before or after it. This approach, distinct from concurrency theory and the theory of computation, represents a paradigm shift that changes our ...
The church-turing thesis over arbitrary domains
Pillars of computer scienceThe Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural numbers (as Church and Kleene did), while others refer to functions over ...
A Church-Turing Thesis for Randomness?
Connecting with ComputabilityAbstractWe discuss the difficulties in stating an analogue of the Church-Turing thesis for algorithmic randomness. We present one possibility and argue that it cannot occupy the same position in the study of algorithmic randomness that the Church-Turing ...
Comments