skip to main content
opinion
Free access

Time to reinspect the foundations?

Published: 28 October 2016 Publication History

Abstract

Questioning if computer science is outgrowing its traditional foundations.

References

[1]
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.
[2]
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.
[3]
Cooper, B., Lowe, B. and Sorbi, A., Eds. New Computational Paradigms: Changing Conceptions of What Is Computable. Springer, 2008.
[4]
Copeland, B. J. The Church-Turing Thesis. The Stanford Encyclopedia of Philosophy. E.N. Zalta, Ed., 2002; http://plato.stanford.edu/entries/church-turing/.
[5]
Copeland, B.J. Narrow versus wide mechanism. The Journal of Philosophy 97, (2000), 5--32.
[6]
Copeland, B.J. Hypercomputation: Philosophical issues. Theoretical Computer Science 317 (2004), 251--267.
[7]
Copeland, B.J. and Proudfoot, D. Alan Turing's forgotten ideas in computer science. Scientific American 280, (1999), 76--81.
[8]
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.
[9]
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.
[10]
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.
[11]
Etesi, G. and Németi, I. Non-Turing computations via Malament-Hogarth space-times. International Journal of Theoretical Physics 41, (2002), 341--370.
[12]
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.
[13]
Goldreich, O. Computational Complexity: A Conceptual Perspective. Cambridge University Press, 2008.
[14]
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.
[15]
Milner, R. Elements of interaction: Turing Award lecture. Commun. ACM 36, 1 (Jan. 1993), 78--89.
[16]
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.
[17]
Pitowsky, I. The physical Church thesis and physical computational complexity. Iyyun 39 (1990), 81--99.
[18]
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.
[19]
Shagrir, O. and Pitowsky, I. Physical hypercomputation and the Church-Turing Thesis. Special issue on hypercomputation. Minds and Machines 13, 1 (2003), 87--101.
[20]
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.
[21]
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.
[22]
Sieg, W. On computability. In A. Irvine, Ed., Handbook of the Philosophy of Mathematics, Elsevier, 2009.
[23]
Stannett, M. X-machines and the halting problem: Building a super-Turing machine. Formal Aspects of Computing 2, (1990), 331--341.
[24]
Wegner, P. and Goldin, D. Computation beyond Turing machines. Commun. ACM 46, 4 (Apr. 2003), 100--102.

Cited By

View all
  • (2022)The Future of Eco-Cognitive SettingsDiscoverability10.1007/978-3-030-93329-6_5(105-126)Online publication date: 21-May-2022
  • (2021)Natural morphological computation as foundation of learning to learn in humans, other living organisms, and intelligent machinesPhilosophical Problems of Information Technologies and Cyberspace10.17726/philIT.2021.1.1(4-34)Online publication date: 14-Jul-2021
  • (2021)Computational Domestication of Ignorant EntitiesEco-Cognitive Computationalism10.1007/978-3-030-81447-2_4(73-103)Online publication date: 31-Aug-2021
  • Show More Cited By

Index Terms

  1. Time to reinspect the foundations?

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Communications of the ACM
    Communications of the ACM  Volume 59, Issue 11
    November 2016
    118 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/3013530
    • Editor:
    • Moshe Y. Vardi
    Issue’s Table of Contents
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 28 October 2016
    Published in CACM Volume 59, Issue 11

    Check for updates

    Qualifiers

    • Opinion
    • Popular
    • Un-reviewed

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)106
    • Downloads (Last 6 weeks)14
    Reflects downloads up to 30 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)The Future of Eco-Cognitive SettingsDiscoverability10.1007/978-3-030-93329-6_5(105-126)Online publication date: 21-May-2022
    • (2021)Natural morphological computation as foundation of learning to learn in humans, other living organisms, and intelligent machinesPhilosophical Problems of Information Technologies and Cyberspace10.17726/philIT.2021.1.1(4-34)Online publication date: 14-Jul-2021
    • (2021)Computational Domestication of Ignorant EntitiesEco-Cognitive Computationalism10.1007/978-3-030-81447-2_4(73-103)Online publication date: 31-Aug-2021
    • (2020)Natural Morphological Computation as Foundation of Learning to Learn in Humans, Other Living Organisms, and Intelligent MachinesPhilosophies10.3390/philosophies50300175:3(17)Online publication date: 1-Sep-2020
    • (2020)Computational domestication of ignorant entitiesSynthese10.1007/s11229-020-02530-5Online publication date: 16-Jan-2020
    • (2019)Why There is no General Solution to the Problem of Software VerificationFoundations of Science10.1007/s10699-019-09611-wOnline publication date: 3-Jun-2019
    • (2018)The Computer and the CalculatorComputer Aided Systems Theory – EUROCAST 201710.1007/978-3-319-74718-7_29(237-244)Online publication date: 26-Jan-2018
    • (2017)The natural science of computingCommunications of the ACM10.1145/310792460:8(31-34)Online publication date: 24-Jul-2017

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Digital Edition

    View this article in digital edition.

    Digital Edition

    Magazine Site

    View this article on the magazine site (external)

    Magazine Site

    Login options

    Full Access

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media