Jack Copeland
Skip Abstract Section
Abstract
Questioning if computer science is outgrowing its traditional foundations.
- Aharonov, D. and Vazirani, U.V. Is quantum mechanics falsifiable? A computational perspective on the foundations of quantum mechanics. In B.J. Copeland, C. Posy, and O. Shagrir, Eds., Computability: Gödel, Turing, Church and Beyond, MIT Press, Cambridge, MA, 2013.Google Scholar
- Bernstein, E. and Vazirani, U.V. Quantum complexity theory. STOC '93 Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (1993), 11--20. Google ScholarDigital Library
- Cooper, B., Lowe, B. and Sorbi, A., Eds. New Computational Paradigms: Changing Conceptions of What Is Computable. Springer, 2008. Google ScholarDigital Library
- Copeland, B. J. The Church-Turing Thesis. The Stanford Encyclopedia of Philosophy. E.N. Zalta, Ed., 2002; http://plato.stanford.edu/entries/church-turing/.Google Scholar
- Copeland, B.J. Narrow versus wide mechanism. The Journal of Philosophy 97, (2000), 5--32.Google Scholar
- Copeland, B.J. Hypercomputation: Philosophical issues. Theoretical Computer Science 317 (2004), 251--267. Google ScholarDigital Library
- Copeland, B.J. and Proudfoot, D. Alan Turing's forgotten ideas in computer science. Scientific American 280, (1999), 76--81.Google ScholarCross Ref
- Copeland, B.J. and Shagrir, O. Turing versus Gödel on computability and the mind. In B.J. Copeland, C. Posy, and O. Shagrir, Eds. Computability: Gödel, Turing, Church and Beyond, MIT Press, Cambridge, MA, 2013.Google Scholar
- Copeland, B.J. and Sommaruga, G. The stored-program universal computer: Did Zuse anticipate Turing and von Neumann? In G. Sommaruga and T. Strahm, Eds., Turing's Revolution, Birkhauser, Basel, 2006.Google Scholar
- Davis, M. The myth of hypercomputation. In C. Teuscher, Ed., Alan Turing: Life and Legacy of a Great Thinker. Springer Verlag, Berlin, 2004, 195--212.Google Scholar
- Etesi, G. and Németi, I. Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics 41, (2002), 341--370.Google ScholarCross Ref
- Gandy, R. Church's thesis and principles for mechanisms. In J. Barwise, D. Kaplan, H.J. Keisler, P. Suppes, and A.S. Troelstra, Eds., The Kleene Symposium, North-Holland, Amsterdam, 1980.Google Scholar
- Goldreich, O. Computational Complexity: A Conceptual Perspective. Cambridge University Press, 2008. Google ScholarDigital Library
- Hogarth, M.L. Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters 5, (1992), 173--181.Google ScholarCross Ref
- Milner, R. Elements of interaction: Turing Award lecture. Commun. ACM 36, 1 (Jan. 1993), 78--89. Google ScholarDigital Library
- Németi, I. and Andréka, H. Can general relativistic computers break the Turing barrier? In A. Beckmann, U. Berger, B. Löwe, and J.V. Tucker, Eds., Logical Approaches to Computational Barriers, Springer-Verlag, Berlin, 2006, 398--412. Google ScholarDigital Library
- Pitowsky, I. The physical Church thesis and physical computational complexity. Iyyun 39 (1990), 81--99.Google Scholar
- Pour-El, M. and Richards, I. The wave equation with computable initial data such that its unique solution is not computable. Advances in Mathematics 39, (1981), 215--239.Google ScholarCross Ref
- Shagrir, O. and Pitowsky, I. Physical hypercomputation and the Church-Turing Thesis. Special issue on hypercomputation. Minds and Machines 13, 1 (2003), 87--101. Google ScholarDigital Library
- Shor, P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26, 5 (1997), 1484--1509. Google ScholarDigital Library
- Sieg, W. Calculations by man and machine: Conceptual analysis. In W. Sieg, R. Sommer, and C. Talcott, Eds., Reflections on the Foundations of Mathematics, Association for Symbolic Logic, Natick, MA, 2002, 390--409.Google Scholar
- Sieg, W. On computability. In A. Irvine, Ed., Handbook of the Philosophy of Mathematics, Elsevier, 2009.Google ScholarCross Ref
- Stannett, M. X-machines and the halting problem: Building a super-Turing machine. Formal Aspects of Computing 2, (1990), 331--341.Google ScholarCross Ref
- Wegner, P. and Goldin, D. Computation beyond Turing machines. Commun. ACM 46, 4 (Apr. 2003), 100--102. Google ScholarDigital Library
Index Terms
- Time to reinspect the foundations?
Recommendations
Foundations of path-dependent types
OOPSLA '14: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & ApplicationsA scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. An essential ingredient of this unification is the concept of objects ...
Foundations for Virtual Types
ECOOP '99: Proceedings of the 13th European Conference on Object-Oriented ProgrammingVirtual types have been proposed as a notation for generic programming in object-oriented languages--an alternative to the more familiar mechanism of parametric classes. The tradeoffs between the two mechanisms are a matter of current debate: for many ...
Foundations of path-dependent types
OOPSLA '14A scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. An essential ingredient of this unification is the concept of objects ...
Comments